#213423. [GCJ 2012 Qualification] Recycled Numbers

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 is recycled if you can obtain by moving some digits from the back of to the front without changing their order. For example, is a recycled pair since you can obtain by moving from the end of to the front. Note that and must have the same number of digits in order to be a recycled pair. Neither nor can have leading zeros.

Given integers and with the same number of digits and no leading zeros, how many distinct recycled pairs are there with A B?

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

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

样例输入 1

4
1 9
10 40
100 500
1111 2222

样例输出 1

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

Are we sure about the output to Case #4?

Yes, we're sure about the output to Case #4.

Limits

• .
• and have the same number of digits.

Test set 1 (10 Pts, Visible Verdict)

.

Test set 2 (15 Pts, Hidden Verdict)

.