This is an interactive problem. There are two hidden non-negative integers (x) and (y) ((0 \leq x, y < 2^{30})). You can ask no more than (2) queries of the following form. Pick a non-negative integer (n) ((0 \leq n < 2^{30})). The judge will respond with the value of ((n \mathbin{|} x) + (n \mathbin{|} y)), where (|) denotes the bitwise OR operation . After this, the judge will give you another non-negative integer (m) ((0 \leq m < 2^{30})). You must answer the correct value of ((m \mathbin{|} x) + (m \mathbin{|} y)). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. Two hidden integers (x) and (y) are chosen ((0 \leq x, y < 2^{30})). Note that (x) and (y) might be different for different test cases. The interactor in this task is not adaptive . In other words, the integers (x) and (y) do not change during the interaction. To ask a query, pick an integer (n) ((0 \leq n < 2^{30})) and print only the integer (n) to a line. You will receive a single integer, the value of ((n \mathbin{|} x) + (n \mathbin{|} y)). You may make no more than (2) queries of the following form. After you finish your queries, output " ! " in a line. You will receive an integer (m) ((0 \leq m < 2^{30})). Note that the value of (m) is also fixed before interaction. You must output only the value of ((m \mathbin{|} x) + (m \mathbin{|} y)) in a line. Note that this line is not considered a query and is not taken into account when counting the number of queries asked. After this, proceed to the next test case. If you make more than (2) queries during an interaction, your program must terminate immediately, and you will receive the Wrong Answer verdict. Otherwise, you can get an arbitrary verdict because your solution will continue to read from a closed stream. Aft