# F(x)

Time Limit: 1000/500 MS (Java/Others)

Memory Limit: 32768/32768 K (Java/Others)

[显示标签]

## Description

For a decimal number x with n digits (AnAn-1An-2 ... A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + ... + A2 * 2 + A1 * 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).

## Input

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 < 109)

## Output

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.

## Sample Input

3
0 100
1 10
5 100

## Sample Output

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

liuyiding

## Source

2013 ACM/ICPC Asia Regional Chengdu Online