#include "tree.h"
#include <bits/stdc++.h>


using namespace std;


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


mt19937 rnd(36346346);
const ll inf = 1e18;

#ifdef LOCAL
bool local = true;
#else
bool local = false;
#endif


void solve_aboba(vector<int> &a){
    int n = a.size();
    if(n <= 1){
        return;
    }
    if(n == 2){
        answer(a[0], a[1]);
        return;
    }
    auto gen_uv = [&](){
        int u = a[rnd() % n];
        int v = a[rnd() % n];
        while(u == v){
            v = a[rnd() % n];
        }
        return make_pair(ask(u, {v}), make_pair(u, v));
    };
    auto gd_uv = gen_uv();
    if(n >= 10){
        for(int itr = 0; itr < 8; itr += 1){
            gd_uv = max(gd_uv, gen_uv());
        }
    }
    auto [dst, uv] = gd_uv;
    auto [u, v] = uv;
    vector<vector<int>> vrtcs(dst + 1);
    vrtcs[0].push_back(u);
    vrtcs[dst].push_back(v);
    vector<int> base_vrtcs(dst + 1);
    base_vrtcs[0] = u;
    base_vrtcs[dst] = v;
    for(int i = 0; i < n; i += 1){
        if(a[i] == u || a[i] == v){
            continue;
        }
        int x = a[i];
        int dstu = ask(u, {x});
        int dstv = ask(v, {x});
        ll dst_bbr = (dstu + dstv - dst) / 2;
        ll rdstu = dstu - dst_bbr;
        vrtcs[rdstu].push_back(x);
        if(dst_bbr == 0){
            base_vrtcs[rdstu] = x;
        }
    }
    for(int i = 0; i < dst; i += 1){
        answer(base_vrtcs[i], base_vrtcs[i + 1]);
    }
    for(int i = 0; i <= dst; i += 1){
        solve_aboba(vrtcs[i]);
    }
}


void solver(int n, int A, int B){
    vector<int> a(n);
    for(int i = 0; i < n; i += 1){
        a[i] = i + 1;
    }
    solve_aboba(a);
}