#ifdef NACHIA #define _GLIBCXX_DEBUG #else #define NDEBUG #endif #include <iostream> #include <string> #include <vector> #include <algorithm> using i64 = long long; using u64 = unsigned long long; #define rep(i,n) for(int i=0; i<int(n); i++) const i64 INF = 1001001001001001001; template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; } template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; } using namespace std; int ask(int u, int v){ cout << "? " << u << " " << v << "\n"; cout.flush(); int x; cin >> x; if(x < 0) exit(0); return x; } int isqrt(int x){ int y = 0; while((y+1)*(y+1) <= x) x++; return y; } void ans(int u, int v){ cout << "! " << u << " " << v << "\n"; cout.flush(); exit(0); } void testcase(){ int H, W; cin >> H >> W; if(H == 1 && W == 1) ans(1, 1); if(H == 1) ans(1, isqrt(ask(1,1))+1); if(W == 1) ans(isqrt(ask(1,1))+1, 1); int a = ask(1,1); int b = ask(H,1); for(int y=1; y<=H; y++) for(int x=1; x<=W; x++){ int dx = x - 1, dy = y - 1; if(dx*dx + dy*dy != a) continue; dy = y - H; if(dx*dx + dy*dy != b) continue; ans(y,x); } } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); testcase(); return 0; }