B'This is an interactive problem. You are given two positive integers n and m ( bf{n <= m} ). The jury has hidden from you a rectangular matrix a with n rows and m columns, where a_{i,j} in { -1, 0, 1 } for all 1 <= i <= n and 1 <= j <= m . The jury has also selected a cell (i_0, j_0) . Your goal is to find (i_0,j_0) . In one query, you give a cell (i, j) , then the jury will reply with an integer. Find (i_0, j_0) by making at most n + 225 queries. Note: the grader is not adaptive: a and (i_0,j_0) are fixed before any queries are made. Each test contains multiple test cases. The first line of input contains a single integer t ( 1 <= t <= 50 ) -- the number of test cases. The description of the test cases follows. The only line of each test case contains two integers n and m ( 1 <= n <= m <= 5000 ) -- the numbers of rows and the number of columns of the hidden matrix a respectively. It is guaranteed that the sum of n cdot m over all test cases does not exceed 25 cdot 10^6 . The interaction for each test case begins by reading the integers n and m . To make a query, output "? i j" ( 1 <= i <= n, 1 <= j <= m ) without quotes. Afterwards, you should read one single integer -- the answer to your query. If you receive the integer -1 instead of an answer or a valid value of n or m , it means your program has made an invalid query, has exceeded the limit of queries, or has given an incorrect answer on the previous test case. Your program must terminate immediately to receive a Wrong Answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream. When you are ready to give the final answer, output "! i j" ( 1 <= i <= n, 1 <= j <= m ) without quotes -- the indices of the hidden cell. After solving a test case'...