#include <atcoder/lazysegtree.hpp>
using namespace atcoder;

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)

#define chmin(x, y) x = min(x, y)
// #include <all.hpp>

// #define int long long

signed main() {
  int h, w;
  cin >> h >> w;
  int ans1, ans2, ans3;
  cout << "? 1 1" << endl;
  cin >> ans1;
  cout << "? 2 1" << endl;
  cin >> ans2;
  cout << "? 1 2" << endl;
  cin >> ans3;
  int x = (ans1 - ans2 + 1) / 2;
  int y = (ans1 - ans3 + 1) / 2;
  cout << "! " << x+1 << " " << y+1 << endl;
    // (a, b) -> a^2 + b^2
  // a^2 + b^2 - 2 b + 1
  // 2b - 1 = ans1 - ans2
}