We call a function good if its domain of definition is some set of integers and if in case it's defined in x and x-1, f(x) = f(x-1) + 1 or f(x) = f(x-1).

Tanya has found n good functions f_{1}, …, f_{n}, which are defined on all integers from 0 to 10^{18} and f_i(0) = 0 and f_i(10^{18}) = L for all i from 1 to n. It's an notorious coincidence that n is a divisor of L. 

She suggests Alesya a game. Using one question Alesya can ask Tanya a value of any single function in any single point. To win Alesya must choose integers l_{i} and r_{i} (0 ≤ l_{i} ≤ r_{i} ≤ 10^{18}), such that f_{i}(r_{i}) - f_{i}(l_{i}) ≥ L/n (here f_i(x) means the value of i-th function at point x) for all i such that 1 ≤ i ≤ n so that for any pair of two functions their segments [l_i, r_i] don't intersect (but may have one common point).

Unfortunately, Tanya doesn't allow to make more than 2 ⋅ 10^{5} questions. Help Alesya to win!

It can be proved that it's always possible to choose [l_i, r_i] which satisfy the conditions described above.

It's guaranteed, that Tanya doesn't change functions during the game, i.e. interactor is not adaptive

Input

The first line contains two integers n and L (1 ≤ n ≤ 1000, 1 ≤ L ≤ 10^{18}, n is a divisor of L) — number of functions and their value in 10^{18}.

Output

When you've found needed l_i, r_i, print "!" without quotes on a separate line and then n lines, i-th from them should contain two integers l_i, r_i divided by space.

Interaction

To ask f_i(x), print symbol "?" without quotes and then two integers i and x (1 ≤ i ≤ n, 0 ≤ x ≤ 10^{18}). Note, you must flush your output to get a response.

After that, you should read an integer which is a value of i-th function in point x.

You're allowed not more than 2 ⋅ 10^5 questions.

To flush you can use (just after printing an integer and end-of-line):

  * fflush(stdout) in C++; 
  * System.out.flush() in Java; 
  * stdout.flush() in Python; 
  * flush(output) in Pascal; 
  * See the documentation for other languages. 



Hacks:

Only tests where 1 ≤ L ≤ 2000 are allowed for hacks, for a hack set a test using following format:

The first line should contain two integers n and L (1 ≤ n ≤ 1000, 1 ≤ L ≤ 2000, n is a divisor of L) — number of functions and their value in 10^{18}.

Each of n following lines should contain L numbers l_1, l_2, ... , l_L (0 ≤ l_j < 10^{18} for all 1 ≤ j ≤ L and l_j < l_{j+1} for all 1 < j ≤ L), in i-th of them l_j means that f_i(l_j) < f_i(l_j + 1).

Example

Input


5 5
? 1 0
? 1 1
? 2 1
? 2 2
? 3 2
? 3 3
? 4 3
? 4 4
? 5 4
? 5 5
!
0 1
1 2
2 3
3 4
4 5


Output


0
1
1
2
2
3
3
4
4
4
5

Note

In the example Tanya has 5 same functions where f(0) = 0, f(1) = 1, f(2) = 2, f(3) = 3, f(4) = 4 and all remaining points have value 5.

Alesya must choose two integers for all functions so that difference of values of a function in its points is not less than L/n (what is 1 here) and length of intersection of segments is zero.

One possible way is to choose pairs [0, 1], [1, 2], [2, 3], [3, 4] and [4, 5] for functions 1, 2, 3, 4 and 5 respectively.
#include <bits/stdc++.h>
using namespace std;
long long query(int i, long long x) {
  cout << "? " << i + 1 << ' ' << x << endl;
  long long r;
  cin >> r;
  return r;
}
pair<long long, long long> ans[1000];
mt19937_64 mrand(chrono::steady_clock::now().time_since_epoch().count());
double log_fac[2000];
double log_ncr(int n, int k) {
  if (n < 0 || k < 0 || k > n) return -1e9;
  return log_fac[n] - log_fac[k] - log_fac[n - k];
}
double prob(int a, int b, int m, int n) {
  assert(a >= 0 && b >= 0 && m >= 0 && m <= n && n >= 0);
  if (a > m) return 1;
  if (n - b <= m) return 0;
  int k = a + b, x = m;
  double r = 0;
  for (int i = 0; i < a; i++) {
    r += exp(log_ncr(x, i) + log_ncr(n - x, k - i) - log_ncr(n, k));
  }
  return r;
}
long long recSplit(long long xl, long long xr, long long ym, int sl,
                   vector<int>& v) {
  if (xr <= xl) return xl;
  assert(sl >= 0 && sl <= v.size());
  if (sl == 0) return xl;
  if (sl == v.size()) return xr;
  shuffle(v.begin(), v.end(), mrand);
  vector<int> vl, vr, vm;
  long long xm = xl + xr >> 1;
  long long assume = -9;
  for (int i : v) {
    long long y;
    if (assume == -9)
      y = query(i, xm);
    else
      y = assume;
    if (y > ym)
      vl.push_back(i);
    else if (y < ym)
      vr.push_back(i);
    else
      vm.push_back(i);
    if (assume == -9 &&
        prob(vl.size(), vm.size() + vr.size(), sl, v.size()) > 1 - 1e-2) {
      assume = ym + 1;
    }
    if (assume == -9 && prob(vr.size(), vm.size() + vl.size(),
                             (int)v.size() - sl, v.size()) > 1 - 1e-2) {
      assume = ym - 1;
    }
  }
  if (vl.size() > sl) {
    return recSplit(xl, xm - 1, ym, sl, vl);
  } else if (vr.size() > (int)v.size() - sl) {
    return recSplit(xm + 1, xr, ym, sl - int(vl.size() + vm.size()), vr);
  } else
    return xm;
}
long long dy;
void solve(long long xl, long long xr, long long yl, long long yr,
           vector<int>& v) {
  assert(yr - yl == dy * v.size());
  if (v.size() <= 1) {
    for (int i : v) ans[i] = {xl, xr};
    return;
  }
  int sl = v.size() / 2;
  long long ym = yl + dy * sl;
  while (1) {
    long long xm = recSplit(xl, xr, ym, sl, v);
    vector<int> vl, vr, vm;
    for (int i : v) {
      long long y = query(i, xm);
      if (y > ym)
        vl.push_back(i);
      else if (y < ym)
        vr.push_back(i);
      else
        vm.push_back(i);
    }
    if (vl.size() > sl || vl.size() + vm.size() < sl) {
      continue;
    }
    while (vl.size() < sl) vl.push_back(vm.back()), vm.pop_back();
    while (vm.size()) vr.push_back(vm.back()), vm.pop_back();
    solve(xl, xm, yl, ym, vl);
    solve(xm, xr, ym, yr, vr);
    break;
  }
}
int main() {
  for (int i = 1; i < 2000; i++) log_fac[i] = log_fac[i - 1] + log(i);
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  long long l;
  cin >> n >> l;
  dy = l / n;
  vector<int> v;
  for (int i = 0; i < n; i++) v.push_back(i);
  solve(0, 1e18, 0, l, v);
  cout << "! " << endl;
  for (int i = 0; i < n; i++)
    cout << ans[i].first << ' ' << ans[i].second << endl;
}
