#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int n, k;

vector<int> v;

void find(int u) {
    if(u == 0) {
        v.push_back(0);
        return;
    }

    find(u-1);
    v.push_back(u);
    find(u-1);
}

int query(int i, int j) {
    cout << i << " " << j << endl;
    int re; cin >> re;
    return re;
}

int main() {
    find(9);

    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k;

    for(int i=n;i>=1;i--) {
        auto x = query(i, i);

        if(x < k) {
            query(i, i);
            continue;
        }

        if(x == k) {
            int u = 0;
            while(1) {
                auto y = query(i, i+v[u++]);
                if(y > k) break;
            }
        }

        if(++k == n) return 0;
    }
}