// Author: Olaf Surgut (surgutti)
// Created on 01-10-2024 15:14:12
#include <bits/stdc++.h>
using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define st first
#define nd second
#define pb push_bask
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define ROF(i, b, a) for (int i = (b); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)

signed main() {

	int n;
	cin >> n;
	int k;
	cin >> k;

	auto flip = [&](int i, int j) {
		cout << i << ' ' << j << endl;
		cin >> k;

		if (k == n) {
			exit(0);
		}
	};

	FOR(i, 1, n - 1) {
		vector<pair<int, int>> segs;

		FOR(j, i, n)
			segs.emplace_back(i, j);

		int prev = 0;
		int goal = -1;
		bool done = false;

		REP(j, 1 << sz(segs)) {
			int mask = j ^ (j >> 1);
			
			if (prev != mask) {
				int id = __builtin_ctz(mask ^ prev);

				flip(segs[id].st, segs[id].nd);
			}
			
			if (k > i) {
				flip(i + 1, n);
				done = true;
			}

			if (k == i) {
				if (goal == -1) {
					goal = mask;
				}
				else {
					flip(i + 1, n);
					done = true;
				}

				if (k == i && done) {
					goal = mask;
					break;
				}
			}

			prev = mask;
		}

		REP(j, sz(segs)) {
			if (((prev >> j) & 1) != ((goal >> j) & 1)) {
				flip(segs[j].first, segs[j].second);
			}
		}
	}

	flip(n, n);

	assert(false);

	return 0;
}