#include <bits/stdc++.h>
using namespace std;
#define int long long
int query(pair<int,int>a){
    cout << a.first << ' ' << a.second << endl;
    int x;
    cin >> x;
    return x;
}
signed main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    int k;
    cin >> k;
    if(k==n)return 0;
    vector<int>a;
    a.push_back(0);
    for(int i = 1; i<13; i++){
        vector<int>b;
        for(int nxt: a){
            b.push_back(nxt);
        }
        b.push_back(i);
        for(int nxt: a){
            b.push_back(nxt);
        }
        swap(a,b);
    }
    for(int i = 1; i<=n; i++){
        if(k==n)return 0;
        vector<pair<int,int>>vals;
        for(int j = i; j<=n; j++){
            vals.push_back({i,j});
        }
        int v = query(vals[a[0]]);
        if(v==n)return 0;
        if(v==k-1){
            query(vals[a[0]]);
            continue;
        }
        int cur = 1;
        while(true){
            int v = query(vals[a[cur]]);
            if(v==n){
                return 0;
            }
            if(v > k){
                int v2 = query(vals[0]);
                if(v2 == n){
                    return 0;
                }
                int v3 = query(vals[0]);
                if(v3 == n){
                    return 0;
                }
                if(v2 < v){
                    break;
                }
            }
            k = v;
            cur++;
        }
    }
    return 0;
}