The oldest man on earth Mr. Royal is a retired spy agent of BCI(Bangladesh Counter Intelligence). Since a retired man, he spent his leisure time by reading spy thriller books. When he reads book, he maintain a sequence of pages. If he reads **N** pages in one day, then next day he will read twice pages **(2*N)** of previous days. For example, if he reads **10** pages in **1st** day, then he reads **20** pages on **2nd** day, **40** pages on **3rd** day, **80** pages on **4th** day and so on.
![enter image description here][1]
One day his great grandchildren asked him, which day did he read the **Kth** page of the book. Since Mr. Royal is a old man he is not able to keep track of pages and days. You have to help him to solve this. You are given the number of pages (**N**) he read on the first day, you have to find the day when he read the **Kth** page of the book.
Input:
------
Input start with test cases **T**.
Each test case there is two integer **N** and **K**, the number of pages read on the first day and the page number of the book.
Constraints:
-----
1<=T<=100000
1<=N,K<=10^18
Output:
-------
Print a line **'Case X: Y'** without quote mark. **X** is the case number start with **1** and **Y** is the answer.
Sample Input
------------
2
1 5
3 2
Sample Output
-------------
Case 1: 3
Case 2: 1
[1]: https://s3-ap-southeast-1.amazonaws.com/devskillimagestorage/questionimages/7920b186-9731-c580-a694-08d521d5ee48_a0e87c8d1b5f423196934a6abc23840a_W197xH256.png