Problem: As you all know, the plum harvesting season is on! Little Milutin had his plums planted in an orchard that can be represented as an n by m matrix. While he was harvesting, he wrote the heights of all trees in a matrix of dimensions n by m.

At night, when he has spare time, he likes to perform various statistics on his trees. This time, he is curious to find out the height of his lowest tree. So far, he has discovered some interesting properties of his orchard. There is one particular property that he thinks is useful for finding the tree with the smallest heigh.

Formally, let L(i) be the leftmost tree with the smallest height in the i-th row of his orchard. He knows that L(i) ≤ L(i+1) for all 1 ≤ i ≤ n - 1. Moreover, if he takes a submatrix induced by any subset of rows and any subset of columns, L(i) ≤ L(i+1) will hold for all 1 ≤ i ≤ n'-1, where n' is the number of rows in that submatrix.

Since the season is at its peak and he is short on time, he asks you to help him find the plum tree with minimal height.

Input

This problem is interactive.

The first line of input will contain two integers n and m, representing the number of rows and the number of columns in Milutin's orchard. It is guaranteed that 1 ≤ n, m ≤ 10^6.

The following lines will contain the answers to your queries.

Output

Once you know have found the minimum value r, you should print ! r to the standard output.

Interaction

Your code is allowed to query for an entry (i, j) of a matrix (i.e. get the height of the tree which is in the i-th row and j-th column). The query should be formatted as ? i j, so that 1 ≤ i ≤ n and 1 ≤ j ≤ m.

You may assume that the entries of the matrix will be integers between 1 and 10^9.

Your solution should use not more than 4 ⋅ (n + m) queries.

This is an interactive problem. You have to use a flush operation right after printing each line. For example, in C++ you should use the function fflush(stdout), in Java — System.out.flush(), in Pascal — flush(output) and in Python — sys.stdout.flush().

Example

Input


5 5
13 15 10 9 15
15 17 12 11 17
10 12 7 6 12
17 19 14 13 19
16 18 13 12 18


Output

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
unordered_map<int, int> f[N];
int n, m, k, ans, p[N], sx[N], sy[N];
inline int sol(int x, int y) {
  if (f[x].count(y)) return f[x][y];
  int t;
  printf("? %d %d\n", x, y), fflush(stdout), scanf("%d", &t);
  return f[x][y] = t;
}
inline vector<int> solve(int n, int m, vector<int>& x, vector<int>& y) {
  if (n >= m) {
    if (n == 1) {
      vector<int> z;
      z.resize(1), z[0] = 1;
      ans = min(ans, sol(x[0], y[0]));
      return z;
    } else {
      vector<int> a, b;
      for (int i = 0; i < n; i += 2) a.push_back(x[i]);
      for (int i = 0; i < m; i++) b.push_back(y[i]);
      vector<int> z = solve((n + 1) / 2, m, a, b), q;
      z.push_back(m);
      int k = 0;
      for (int i = 0; i < n; i++) {
        if (i % 2 == 0)
          q.push_back(z[k++]);
        else {
          int sum = 1000000001, pos = 0;
          for (int c = z[k - 1]; c <= z[k]; c++) {
            int g = sol(x[i], y[c - 1]);
            if (sum > g) sum = g, pos = c;
          }
          q.push_back(pos), ans = min(ans, sum);
        }
      }
      return q;
    }
  } else {
    int l = 1;
    sx[l] = 1, sy[l] = 1;
    for (int i = 2; i <= m; i++) {
      while (l > 0) {
        int a = sol(x[sx[l] - 1], y[sy[l] - 1]),
            b = sol(x[sx[l] - 1], y[i - 1]);
        if (a > b)
          l--;
        else
          break;
      }
      if (sx[l] != n) l++, sx[l] = sx[l - 1] + 1, sy[l] = i;
    }
    vector<int> a, b, w;
    for (int i = 0; i < n; i++) a.push_back(x[i]);
    for (int i = 1; i <= l; i++) b.push_back(y[sy[i] - 1]), w.push_back(sy[i]);
    vector<int> z = solve(n, l, a, b), q;
    for (int i = 0; i < w.size(); i++) p[i + 1] = w[i];
    for (int i = 0; i < z.size(); i++) q.push_back(p[z[i]]);
    return q;
  }
}
int main() {
  cin >> n >> m;
  vector<int> a, b;
  a.resize(n), b.resize(m), ans = 1000000000;
  for (int i = 0; i < n; i++) a[i] = i + 1;
  for (int i = 0; i < m; i++) b[i] = i + 1;
  solve(n, m, a, b);
  printf("! %d\n", ans);
  return 0;
}