#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
const int inf = 1000 * 1000 * 1000;
const int mod = 998244353;
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
int answ = inf;
int mat[105][105];
int query(int x, int y) {
  printf("? %d %d\n", x, y);
  fflush(stdout);
  int res;
  scanf("%d", &res);
  answ = min(answ, res);
  return res;
}
int ind[N];
void solve(vector<int>& X, vector<int>& U) {
  if ((int)X.size() == 1) {
    int mn;
    for (int i = 0; i < (int)U.size(); i++) {
      int val = query(X[0], U[i]);
      if (i == 0 || val < mn) {
        mn = val;
        ind[0] = i;
      }
    }
    return;
  }
  if ((int)U.size() == 1) {
    for (int i = 0; i < (int)X.size(); i++) {
      int val = query(X[i], U[0]);
      ind[i] = 0;
    }
    return;
  }
  if ((int)X.size() >= (int)U.size()) {
    vector<int> newX;
    for (int i = 0; i < (int)X.size(); i += 2) {
      newX.push_back(X[i]);
    }
    solve(newX, U);
    for (int i = (int)newX.size() - 1; i >= 0; i--) {
      ind[2 * i] = ind[i];
    }
    for (int i = 1; i < (int)X.size(); i += 2) {
      int l = ind[i - 1],
          r = (i == (int)X.size() - 1) ? (int)U.size() - 1 : ind[i + 1];
      int mn;
      for (int j = l; j <= r; j++) {
        int val = query(X[i], U[j]);
        if (j == l || val < mn) {
          mn = val;
          ind[i] = j;
        }
      }
    }
    return;
  }
  vector<int> newVal;
  vector<int> newU;
  vector<int> newInd;
  int curX = 0, lst = -1, id = -1;
  for (int i = 0; i < (int)U.size(); i++) {
    if ((int)newU.size() == 0) {
      int val = query(X[curX], U[i]);
      newVal.push_back(val);
      newU.push_back(U[i]);
      newInd.push_back(i);
    } else {
      while ((int)newU.size()) {
        int val = query(X[curX], U[i]);
        if (newVal.back() > val) {
          --curX;
          newVal.pop_back();
          newU.pop_back();
          newInd.pop_back();
        } else {
          break;
        }
      }
      if (curX + 1 != (int)X.size()) {
        ++curX;
        int val = query(X[curX], U[i]);
        newVal.push_back(val);
        newU.push_back(U[i]);
        newInd.push_back(i);
      }
    }
  }
  solve(X, newU);
  for (int i = 0; i < (int)X.size(); i++) {
    ind[i] = newInd[ind[i]];
  }
}
int main() {
  cin >> n >> m;
  vector<int> X, U;
  for (int i = 1; i <= n; i++) {
    X.push_back(i);
  }
  for (int j = 1; j <= m; j++) {
    U.push_back(j);
  }
  solve(X, U);
  cout << "! " << answ << endl;
  cout.flush();
  return 0;
}
