#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > ans;
long long dist;
long long inter(int i, long long x) {
  long long a = 0;
  cout << "? " << i << " " << x << endl;
  cin >> a;
  return a;
}
void divide(long long l, long long r, int mi, int ma, vector<int>& todo) {
  if (ma - mi == 1) {
    ans[todo[0]] = make_pair(l, r);
    return;
  }
  int next = (ma + mi) / 2;
  long long low = l + 1;
  long long high = r - 1;
  vector<int> big_todo, small_todo;
  vector<bool> poss(todo.size(), true);
  while (true) {
    int piv = rand() % todo.size();
    while (!poss[piv]) piv = rand() % todo.size();
    piv = todo[piv];
    long long low_piv = low;
    long long high_piv = high;
    long long tr;
    while (true) {
      tr = (low_piv + high_piv) / 2;
      long long ans_piv = inter(piv, tr);
      if (ans_piv == next * dist)
        break;
      else if (ans_piv < next * dist)
        low_piv = tr + 1;
      else
        high_piv = tr - 1;
    }
    int cnt_big = 0;
    int cnt_small = 0;
    vector<int> dir(todo.size());
    for (int i = 0; i < todo.size(); i++) {
      if (!poss[i]) continue;
      long long a = inter(todo[i], tr);
      if (a > next * dist) {
        cnt_big++;
        dir[i] = 1;
      } else if (a < next * dist) {
        cnt_small++;
        dir[i] = -1;
      }
    }
    if (cnt_big + big_todo.size() <= next - mi &&
        cnt_small + small_todo.size() <= ma - next) {
      for (int i = 0; i < todo.size(); i++) {
        if (!poss[i]) continue;
        if (dir[i] == 1) {
          big_todo.push_back(todo[i]);
          poss[i] = false;
        } else if (dir[i] == -1) {
          small_todo.push_back(todo[i]);
          poss[i] = false;
        }
      }
      for (int i = 0; i < todo.size(); i++) {
        if (!poss[i]) continue;
        if (big_todo.size() < next - mi) {
          big_todo.push_back(todo[i]);
          poss[i] = false;
        } else {
          small_todo.push_back(todo[i]);
          poss[i] = false;
        }
      }
      divide(l, tr, mi, next, big_todo);
      divide(tr, r, next, ma, small_todo);
      return;
    }
    if (cnt_big + big_todo.size() > next - mi) {
      high = tr - 1;
      for (int i = 0; i < todo.size(); i++) {
        if (poss[i] && dir[i] <= 0) {
          small_todo.push_back(todo[i]);
          poss[i] = false;
        }
      }
    } else if (cnt_small + small_todo.size() > ma - next) {
      low = tr + 1;
      for (int i = 0; i < todo.size(); i++) {
        if (poss[i] && dir[i] >= 0) {
          big_todo.push_back(todo[i]);
          poss[i] = false;
        }
      }
    }
  }
}
int main() {
  int n;
  long long L;
  cin >> n >> L;
  ans.resize(n + 1);
  dist = L / n;
  vector<int> todo(n);
  for (int i = 0; i < n; i++) todo[i] = i + 1;
  divide(0, 1000000000000000000, 0, n, todo);
  cout << "! " << endl;
  for (int i = 1; i <= n; i++) {
    cout << ans[i].first << " " << ans[i].second << endl;
  }
  return 0;
}
