from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

# https://github.com/manuo-git/python-lib/blob/main/src/floor_sum.py
# https://atcoder.jp/contests/abc443/editorial/15138
def floor_sum(n, m, a, b):
    a1, a2 = a//m, a%m
    s = n*(n-1)//2*a1
    b1, b2 = b//m, b%m
    if a2 == 0: return s+b1*n
    k = (a2*(n-1)+b2)//m
    return s+n*(k+b1)-floor_sum(k, a2, m, m+a2-b2-1)

K = 1000000
A = [K]
while K > 1:
    K = -(-K//2)
    A.append(K)
A.reverse()
# print(A)
# print(len(A))
K = len(A)

for _ in range(int(input())):
    D = dict()
    q = 0
    def value(m):
        b = A[m]
        if b in D: return D[b]
        global q
        q += 1
        print(f"? 0 {b}")
        res = int(input())
        D[b] = res
        return res

    def check(m):
        res = value(m)
        return res > 0

    l, r = -1, K
    while r-l>1:
        m = (l+r)//2
        if check(m): r = m
        else: l = m
    ans = value(r)
    print(f"! {ans}")