1999G.cpp

#include <bits/stdc++.h>
#define pb push_back
#define fr first
#define sc second
#define mod 1000000007
#define mod2 998244353
#define len(x) x.size()
#define min3(a,b,c) min(a, min(b,c))
#define max3(a,b,c) max(a, max(b,c))
#define all(v) v.begin(), v.end()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1,i>=a;i--)
#define int  long long
#define endl " \n"
using namespace std;
// Make sure to have 1 as 1ll for more than 32 bits
// Make sure to have seprate variables in nested loops
// Make sure minimum initialisation are large enough
// Make sure to use values before reinitilaising them such as count or sum
typedef unsigned long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvii;
typedef vector<string> vs;
int query(int a,int b){
	cout << "? " << a << " " << b << endl;
	cout.flush();
	int x;cin >> x;
	return x;
}
int32_t  main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
		int t;cin >> t;
		while(t--){
			int l = 2,r = 999;
			while(l < r){
				int m1 = (2*l + r)/3;
				int m2 = (l + 2*r)/3;
				int val = query(m1,m2);
				if(val == m1*m2){
					l = m2 + 1;
				}
				else if(val == m1*(m2 + 1)){
					l = m1 + 1;
					r = m2;
				}
				else{
					r = m1;
				}
			}
			cout << "! " << l <<  endl;
			cout.flush();
		}
}