#include <bits/stdc++.h>
using namespace std;
const long long N = 1e3 + 2;
pair<long long, long long> ans[N];
long long n;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long ask(long long idx, long long val, long long debt) {
  cout << "? " << idx << ' ' << val << endl;
  cin >> idx;
  return idx - debt;
}
void solve(long long lef, long long rig, vector<long long> idx, long long val,
           long long debt) {
  if (!idx.size()) {
    return;
  }
  if (idx.size() == 1) {
    ans[idx[0]] = {lef, rig};
    return;
  }
  long long sz = idx.size() / 2, newval = (val / idx.size()) * sz, i, j, k, l,
            m, need = sz;
  vector<long long> temp, lis1, lis2, lis3, idx1, idx2;
  for (i = 0; i < idx.size(); i++) {
    temp.push_back(idx[i]);
  }
  while (temp.size() > 1) {
    i = temp[rng() % temp.size()];
    j = lef;
    k = rig;
    while (j < k) {
      m = (j + k) / 2;
      l = ask(i, m, debt);
      if (l >= newval) {
        k = m;
      } else {
        j = m + 1;
      }
    }
    lis1.clear();
    lis2.clear();
    lis3.clear();
    for (i = 0; i < temp.size(); i++) {
      j = ask(temp[i], k, debt);
      if (j > newval) {
        lis1.push_back(temp[i]);
      } else {
        if (j == newval) {
          lis3.push_back(temp[i]);
        } else {
          lis2.push_back(temp[i]);
        }
      }
    }
    if (lis1.size() <= need && lis2.size() <= temp.size() - need) {
      while (lis1.size() + 1 <= need) {
        lis1.push_back(lis3.back());
        lis3.pop_back();
      }
      while (lis3.size()) {
        lis2.push_back(lis3.back());
        lis3.pop_back();
      }
      while (lis1.size()) {
        idx1.push_back(lis1.back());
        lis1.pop_back();
      }
      while (lis2.size()) {
        idx2.push_back(lis2.back());
        lis2.pop_back();
      }
      break;
    } else {
      if (lis1.size() > need) {
        temp = lis1;
        while (lis2.size()) {
          idx2.push_back(lis2.back());
          lis2.pop_back();
        }
        while (lis3.size()) {
          idx2.push_back(lis3.back());
          lis3.pop_back();
        }
      } else {
        need -= (lis1.size() + lis3.size());
        temp = lis2;
        while (lis1.size()) {
          idx1.push_back(lis1.back());
          lis1.pop_back();
        }
        while (lis3.size()) {
          idx1.push_back(lis3.back());
          lis3.pop_back();
        }
      }
    }
  }
  solve(lef, k, idx1, newval, debt);
  solve(k, rig, idx2, (val / idx.size()) * (idx.size() - sz), debt + newval);
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long m, i, j, k, l;
  cin >> n >> l;
  vector<long long> idx;
  for (i = 1; i <= n; i++) {
    idx.push_back(i);
  }
  solve(0, 1e18, idx, l, 0);
  cout << "!" << endl;
  for (i = 1; i <= n; i++) {
    cout << ans[i].first << ' ' << ans[i].second << '\n';
  }
}
