#include <bits/stdc++.h>
#define size(a) (ll)(a).size()
#define int long long

using namespace std;
mt19937_64 urng_64(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937 urng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int INF = INT_MAX;
const ll INF_LL = LLONG_MAX;
const ld EPS = 1e-9;
const ll MOD = 1e9 + 7; //998244353;

int SEGMENTS;
int interact(int p1, int p2) {
    cout << p1 << ' ' << p2 << endl;
    int val;
    cin >> val;

    if (val == SEGMENTS) {
        exit(0);
    }
    return val;
}

vector<int> prev_state(vector<int> state, int len);
vector<int> next_state(vector<int> state, int len) {
    if (len == 0) {
        return state;
    }

    if (state[len - 1] == 0) {
        auto next = next_state(state, len - 1);
        if (next == state) {
            next[len - 1] = 1;
        }
        return next;
    } else {
        return prev_state(state, len - 1);
    }
}

vector<int> prev_state(vector<int> state, int len) {
    if (len == 0) {
        return state;
    }

    if (state[len - 1] == 0) {
        return prev_state(state, len - 1);
    } else {
        auto next = next_state(state, len - 1);
        if (next == state) {
            next[len - 1] = 0;
        }
        return next;
    }
}

int find_diff(vector<int>& a, vector<int>& b) {
    for (int i = 0; i < size(a); ++i) {
        if (a[i] != b[i]) {
            return i;
        }
    }
    return -1;
}

void change_to_best(vector<int>& state, vector<int>& best, int pos) {
    for (int i = 0; i < size(state); ++i) {
        if (state[i] != best[i]) {
            interact(pos + 1, pos + 1 + i);
        }
    }
}

void solve() {
    int n, cur;
    cin >> n >> cur;
    SEGMENTS = n;

    for (int i = 0; i < n; ++i) {
        vector<int> state(n - i, 0);

        int best = cur;
        vector<int> best_state = state;

        while (state != next_state(state, n - i)) {
            auto tmp = next_state(state, n - i);
            int diff = find_diff(tmp, state);

            cur = interact(i + 1, i + diff + 1);
            if (cur > best) {
                best = cur;
                best_state = tmp;
            }
            state = tmp;
        }

        change_to_best(state, best_state, i);
        cur = best;
    }
}

signed main() {
#ifdef LOCAL
    //    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
#endif
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout.precision(20);

    solve();
}