**Problem Description**

_{2}

^{n})). If we call the finals of the tournament round r, the semi-finals round r-1, etc., then the way in which seeding is done can be described as follows: in round k, we arrange players such that the ideal match strength for all matches in that round is 2

^{r-k+1}+1. For example, the seeding of a match of 13 people would look as follow:

You are asked to solve the following problem: given the values of n and m, determine the earliest round in a tournament of n players in which a match strength of m could occur. You may assume that the seeding is done in the manner described above.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

**Input**

You will be given a number of cases in the input. Each case will be specified on one line, consisting of two integers n and m, where 2 <= n <= 100 and m >= 3. You may assume in each case that a match strength of m can occur during some round. Input is terminated by a case in which n = m = 0.

**Output**

For each test case, print the case number and the earliest round for that case in format shown below.

**Sample Input**

1 100 3 13 10 0 0

**Sample Output**

Case 1: Round 7 Case 2: Round 2

**Source**

East Central North America 1999, Practice