#include "tree.h"
#include<bits/stdc++.h>
using namespace std;
inline int read() {
    int x = 0;
    char c = getchar();
    bool f = 0;
    while(!isdigit(c)) f |= (c == '-'), c = getchar();
    while(isdigit(c)) x = (x * 10) + (c ^ 48), c = getchar();
    return f ? -x : x;
}
const int maxn = 2005;
int ask(int u, vector<int> v);
void answer(int u, int v);
int Dep[maxn], P[maxn], End[maxn], Son[maxn], Siz[maxn], Fa[maxn];
vector <int> Edge[maxn], Sub[maxn], Cnt;
inline bool cmp(int x, int y) { return Dep[x] < Dep[y]; }
inline void Search(int x) {
    Siz[x] = 1;
    for(int y : Edge[x]) {
        Search(y);
        Siz[x] += Siz[y];
        if(Siz[y] > Siz[Son[x]]) Son[x] = y;
    }
    if(Son[x]) End[x] = End[Son[x]];
    else End[x] = x;
}
inline void Update_Sub(int x) {
    int id = x;
    while(x) Sub[x].emplace_back(id), x = Fa[x];
}
inline void Work(int x, int v) {
//    if(!Edge[x].size()) { answer(x, v), Edge[x].emplace_back(v), Fa[v] = x, Update_Sub(v); return ; }
    Cnt.clear(), Cnt.emplace_back(End[x]);
    int d = ask(v, Cnt), LCA = End[x], dep = (Dep[v] + Dep[End[x]] - d) / 2;
    while(Dep[LCA] > dep) LCA = Fa[LCA];
    if(LCA == End[x]) { answer(End[x], v), Edge[End[x]].emplace_back(v), Fa[v] = End[x], Update_Sub(v); return ; }
    int Nex = 0;
    for(int y : Edge[LCA]) {
        Cnt.clear(), Cnt = Sub[y], Cnt.emplace_back(v);
        int d1 = ask(v, Sub[y]), d2 = ask(LCA, Cnt);
        if(d1 == d2) continue;
        Nex = y; break;
    }
    Work(Nex, v);
}
void solver(int n, int A, int B) {
    iota(P + 1, P + n + 1, 1);
    for(register int i = 2; i <= n; ++i) {
        Cnt.clear(), Cnt.emplace_back(i);
        Dep[i] = ask(1, Cnt);
        if(Dep[i] == 1) answer(1, i), Edge[1].emplace_back(i), Fa[i] = 1, Update_Sub(i);
    }
    sort(P + 2, P + n + 1, cmp);
    for(register int i = 2; i <= n; ++i) {
        if(Dep[P[i]] <= 1) continue;
        Search(1);
        Work(1, P[i]);
    }
}