B'Gustaw is the chief bank manager in a huge bank. He has unlimited access to the database system of the bank, in a few clicks he can move any amount of money from the bank 's reserves to his own private account. However, the bank uses some fancy AI fraud detection system that makes stealing more difficult. Gustaw knows that the anti-fraud system just detects any operation that exceeds some fixed limit M euros and these operations are checked manually by a number of clerks. Thus, any fraud operation exceeding this limit is detected, while any smaller operation gets unnoticed. Gustaw doesn 't know the limit M and wants to find it out. In one operation, he can choose some integer X and try to move X euros from the bank 's reserves to his own account. Then, the following happens. Initially Gustaw has 1 euro on his account. Help him find the exact value of M in no more than 105 operations without getting him fired. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 1000 ). For each test case, there is no input prior to your first query, but you can be sure that M is integer, and 0 <= M <= 10^{14} . For each test case, when you know the exact value of M , print a single line with format "! M ". After that your program should proceed to the next test case or terminate, if it is the last one. When you want to make an operation, print a single line with format "? X ", denoting that you try to move X euros ( 1 <= X <= 10^{14} ). As a response, read a single line that can take the following values: You can make at most 105 such queries in each test case. After printing a query do not forget to output end of line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use: Hacks To make a hack, prepare an input in the following format. The first line contains a single integer t ( 1 <= '...