#include using namespace std; using ll = long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; #define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep2(i, a, b) rep3(i, a, b, 1) #define rep1(i, n) rep2(i, 0, n) #define rep0(n) rep1(aaaaa, n) #define ov4(a, b, c, d, name, ...) name #define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__) #define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--) #define fore(e, v) for (auto&& e : v) #define all(a) begin(a), end(a) #define sz(a) (int)(size(a)) #define lb(v, x) (lower_bound(all(v), x) - begin(v)) #define eb emplace_back template bool chmin(T& a, const S& b) { return a > b ? a = b, 1 : 0; } template bool chmax(T& a, const S& b) { return a < b ? a = b, 1 : 0; } const int INF = 1e9 + 100; const ll INFL = 3e18 + 100; #define i128 __int128_t struct _ { _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); } } __; int main(){ vector X; const int YXMAX=1'000'000; X.eb(pii{0,YXMAX+1}); vi dX; auto query=[&](int xl,int xr,int yl,int yr){ cout<<"? "<>ret; return ret; }; while(!X.empty()){ vector X2; fore(i,X){ if(i.first+1==i.second){ dX.eb(i.first); continue; } int l=i.first,r=i.second,mid=(l+r)/2; if(query(l,mid,0,YXMAX+1)){ X2.eb(pii{l,mid}); } if(query(mid,r,0,YXMAX+1)){ X2.eb(pii{mid,r}); } } X=X2; } vector ans; fore(x,dX){ vector Y; Y.eb(pii{0,YXMAX}); while(!Y.empty()){ vector Y2; fore(i,Y){ if(i.first+1==i.second){ ans.eb(pii{x,i.first}); continue; } int l=i.first,r=i.second,mid=(l+r)/2; if(query(x,x+1,l,mid)){ Y2.eb(pii{l,mid}); } if(query(x,x+1,mid,r)){ Y2.eb(pii{mid,r}); } } Y=Y2; } } cout<<"! "<