F(x)

For a decimal number x with n digits (A_nA_n-1A_n-2 ... A₂A₁), we define its weight as F(x) = A_n * 2^n-1 + A_n-1 * 2^n-2 + ... + A₂ * 2 + A₁ * 1. Now you are given two numbers A and B, please calculate how many numbers are there between 0 and B, inclusive, whose weight is no more than F(A).

The first line has a number T (T <= 10000) , indicating the number of test cases.
For each test case, there are two numbers A and B (0 <= A,B < 10⁹)

For every case,you should output "Case #t: " at first, without quotes. The t is the case number starting from 1. Then output the answer.

3
0 100
1 10
5 100

Case #1: 1
Case #2: 2
Case #3: 13

2013 ACM/ICPC Asia Regional Chengdu Online