Actually it is a solution to this question:-

Alice and Bob are playing a game. Alice initially has the number A and Bob has the number B. There are a total of N turns in the game, and Alice and Bob alternatively take turns. In each turn the player whose turn it is, multiplies his or her number by 2. Alice has the first turn.

Suppose after all the N turns, Alice's number has become C and Bob's number has become D. You want to calculate the integer division of the maximum number among C and D by the minimum number among C and D.

Input

• The first line of the input contains an integer T denoting the number of

test cases. The description of each testcase follows.

• Each test case contains a single line with 3 integers A, B, and N.

Output

For each test case output a new line with a single integer which should be the answer

I tried to restrict the least value of A and B to one but it is not working.

Here is what I did.....