#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;
    if(re == n) exit(0);
    return re;
}

int main() {
    find(9);

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

    for(int i=1;i<=n;i++) {
        int mx = k, mxb = 0, b = 0;

        for(int j=0;j<(1<<n-i+1)-1;j++) {
            auto re = query(i, i+v[j]);
            b ^= 1 << v[j];
            if(re > mx) mx = re, mxb = b;
        }

        for(int j=0;j<n-i+1;j++) if(((mxb >> j) & 1) != ((b >> j) & 1)) k = query(i, i+j);
    }
}