#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

void answer(int i, int j) {
  cout << "! " << i + 1 << ' ' << j + 1 << endl;
}

int ask(int i, int j) {
  cout << "? " << i + 1 << ' ' << j + 1 << endl;
  int res;
  cin >> res;
  assert(res != -1);
  return res;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int h, w;
  cin >> h >> w;
  if (h == 1 && w == 1) {
    answer(0, 0);
    return 0;
  }
  int d0 = ask(0, 0);
  vector<P> cand;
  rep(i, h) rep(j, w) {
    if (i * i + j * j == d0) {
      cand.emplace_back(i, j);
    }
  }
  assert(!cand.empty());
  if (cand.size() == 1) {
    auto [i, j] = cand[0];
    answer(i, j);
    return 0;
  }
  int d1 = ask(h - 1, 0);
  int x = -1, y = -1;
  for (auto [i, j] : cand) {
    int di = h - 1 - i;
    if (di * di + j * j == d1) {
      assert(x == -1);
      tie(x, y) = P(i, j);
    }
  }
  assert(x != -1);
  answer(x, y);
}