#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
mt19937 rng(chrono::steady_clock().now().time_since_epoch().count());
int rand(int a, int b) { return uniform_int_distribution<int>(a, b)(rng); }
int que = 0;
ll ask(int func, ll x) {
  que++;
  if (que > 200000) exit(-1);
  printf("? %d %lld\n", func, x);
  fflush(stdout);
  ll ans;
  scanf("%lld", &ans);
  return ans;
}
ll find_first(int func, ll val) {
  ll pocz = 0, kon = 1e18, mid;
  while (pocz < kon) {
    mid = (pocz + kon) / 2;
    if (ask(func, mid) >= val)
      kon = mid;
    else
      pocz = mid + 1;
  }
  return pocz;
}
ll find_last(int func, ll val) {
  ll pocz = 0, kon = 1e18, mid;
  while (pocz < kon) {
    mid = (pocz + kon + 1) / 2;
    if (ask(func, mid) <= val)
      pocz = mid;
    else
      kon = mid - 1;
  }
  return pocz;
}
vector<int> find_k_smallest(vector<int> func, int k, ll val) {
  assert(k >= 0 && k <= func.size());
  if (k == 0 || func.empty()) return {};
  if (k == (int)func.size()) return func;
  swap(func[0], func[rand(0, func.size() - 1)]);
  ll where0 = find_first(func[0], val);
  vector<int> smaller, equal, larger;
  for (int i = 0; i < func.size(); i++) {
    ll hlp;
    if ((hlp = ask(func[i], where0)) > val)
      smaller.push_back(func[i]);
    else if (hlp < val)
      larger.push_back(func[i]);
    else
      equal.push_back(func[i]);
  }
  if (k <= smaller.size()) return find_k_smallest(smaller, k, val);
  if (k <= smaller.size() + equal.size()) {
    int ss = smaller.size();
    for (int i = 0; i < k - ss; i++) smaller.push_back(equal[i]);
    return smaller;
  }
  vector<int> hlp =
      find_k_smallest(larger, k - smaller.size() - equal.size(), val);
  for (int x : equal) smaller.push_back(x);
  for (int x : hlp) smaller.push_back(x);
  return smaller;
}
pll res[1007];
int n;
ll L;
int counter[1007];
int cnt;
void solve(vector<int> func, ll l1, ll l2) {
  if (func.empty()) return;
  ll l = L / n;
  assert(l2 >= l1);
  assert((l2 - l1) % l == 0);
  assert((l2 - l1) / l == func.size());
  if (func.size() == 1) {
    res[func[0]] = {0, find_first(func[0], l2)};
    return;
  }
  int n = func.size();
  int sn = n / 2;
  ll lmid = l1 + (l2 - l1) / n * sn;
  int qer = que;
  vector<int> fst = find_k_smallest(func, sn, lmid);
  solve(fst, l1, lmid);
  cnt++;
  for (int x : fst) counter[x] = cnt;
  vector<int> sc;
  for (int x : func)
    if (counter[x] != cnt) sc.push_back(x);
  solve(sc, lmid, l2);
}
void answer() {
  printf("!\n");
  vector<pll> hlp;
  for (int i = 1; i <= n; i++) hlp.emplace_back(res[i].second, i);
  sort(hlp.begin(), hlp.end());
  for (int i = 1; i < n; i++)
    res[hlp[i].second].first = res[hlp[i - 1].second].second;
  for (int i = 1; i <= n; i++) {
    printf("%lld %lld\n", res[i].first, res[i].second);
  }
}
int main() {
  scanf("%d%lld", &n, &L);
  vector<int> hlp;
  for (int i = 1; i <= n; i++) hlp.push_back(i);
  solve(hlp, 0, L);
  answer();
  return 0;
}
