시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
5 초 512 MB 20 12 11 61.111%

문제

Do you ever become frustrated with television because you keep seeing the same things, recycled over and over again? Well I personally don't care about television, but I do sometimes feel that way about numbers.

Let's say a pair of distinct positive integers (nm) is recycled if you can obtain m by moving some digits from the back of n to the front without changing their order. For example, (12345, 34512) is a recycled pair since you can obtain 34512 by moving 345 from the end of 12345 to the front. Note that n and m must have the same number of digits in order to be a recycled pair. Neither n nor m can have leading zeros.

Given integers A and B with the same number of digits and no leading zeros, how many distinct recycled pairs (nm) are there with A ≤ n < m ≤ B?

입력

The first line of the input gives the number of test cases, TT test cases follow. Each test case consists of a single line containing the integers A and B.

Limits

  • 1 ≤ T ≤ 50.
  • A and B have the same number of digits.
  • 1 ≤ A ≤ B ≤ 2000000.

출력

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1), and y is the number of recycled pairs (nm) with A ≤ n < m ≤ B.

예제 입력 1

4
1 9
10 40
100 500
1111 2222

예제 출력 1

Case #1: 0
Case #2: 3
Case #3: 156
Case #4: 287

힌트