#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 1000;
const long long XMIN = 0LL;
const long long XMAX = 1000000000000000000LL;
mt19937 rnd((int)std::chrono::steady_clock::now().time_since_epoch().count());
int n;
long long ymax;
long long lans[MAXN], rans[MAXN];
long long eval(int idx, long long x) {
  printf("? %d %lld\n", idx + 1, x);
  fflush(stdout);
  long long y;
  scanf("%lld", &y);
  return y;
}
long long findx(int idx, long long y, long long lx, long long hx) {
  --lx;
  while (lx + 1 < hx) {
    long long mx = lx + (hx - lx) / 2;
    long long cy = eval(idx, mx);
    if (cy < y)
      lx = mx;
    else
      hx = mx;
  }
  return hx;
}
void rec(const vector<int> &rem, long long lx, long long hx, long long ly,
         long long hy) {
  if (((int)(rem).size()) == 1) {
    lans[rem[0]] = lx, rans[rem[0]] = hx;
    return;
  }
  vector<int> cand = rem;
  int n1 = ((int)(rem).size()) / 2, n2 = ((int)(rem).size()) - n1;
  assert((hy - ly) % (n1 + n2) == 0);
  long long mx = -1, my = ly + (hy - ly) / (n1 + n2) * n1;
  vector<int> lft, rgt;
  while (true) {
    int cur = cand[rnd() % ((int)(cand).size())];
    long long cx = findx(cur, my, lx, hx);
    vector<int> candbefore, candeq, candafter;
    candeq.push_back(cur);
    for (int i = (0); i < (((int)(cand).size())); ++i) {
      int idx = cand[i];
      if (idx == cur) continue;
      long long cy = eval(idx, cx);
      if (cy < my)
        candafter.push_back(idx);
      else if (cy > my)
        candbefore.push_back(idx);
      else
        candeq.push_back(idx);
    }
    if (((int)(lft).size()) + ((int)(candbefore).size()) > n1) {
      for (int i = (0); i < (((int)(candafter).size())); ++i)
        rgt.push_back(candafter[i]);
      for (int i = (0); i < (((int)(candeq).size())); ++i)
        rgt.push_back(candeq[i]);
      cand = candbefore;
      continue;
    }
    if (((int)(rgt).size()) + ((int)(candafter).size()) > n2) {
      for (int i = (0); i < (((int)(candbefore).size())); ++i)
        lft.push_back(candbefore[i]);
      for (int i = (0); i < (((int)(candeq).size())); ++i)
        lft.push_back(candeq[i]);
      cand = candafter;
      continue;
    }
    mx = cx;
    for (int i = (0); i < (((int)(candbefore).size())); ++i)
      lft.push_back(candbefore[i]);
    for (int i = (0); i < (((int)(candafter).size())); ++i)
      rgt.push_back(candafter[i]);
    for (int i = (0); i < (((int)(candeq).size())); ++i)
      if (((int)(lft).size()) < n1)
        lft.push_back(candeq[i]);
      else
        rgt.push_back(candeq[i]);
    assert(((int)(lft).size()) == n1 && ((int)(rgt).size()) == n2);
    break;
  }
  rec(lft, lx, mx, ly, my);
  rec(rgt, mx, hx, my, hy);
}
void solve() {
  vector<int> all(n);
  for (int i = (0); i < (n); ++i) all[i] = i;
  rec(all, XMIN, XMAX, 0, ymax);
}
void run() {
  scanf("%d%lld", &n, &ymax);
  solve();
  printf("!\n");
  for (int i = (0); i < (n); ++i) printf("%lld %lld\n", lans[i], rans[i]);
  fflush(stdout);
}
int main() {
  run();
  return 0;
}
