#include<bits/stdc++.h>
#include "tree.h"
#define LL long long
#define bs vector<int>
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=1e3+5;
mt19937 rnd(time(0));
int n,fa[N],d[N],lca[N][N];bs g[N];
inline int dis(int x,int y){return d[x]+d[y]-(d[lca[x][y]]<<1);}
inline void upd(int x,int fa)
{
	::fa[x]=fa;d[x]=d[fa]+1;
	for(int i=1;i<=n;i++) lca[x][i]=lca[i][x]=lca[fa][i];
	lca[x][x]=x;
}
inline void sol(int x,bs g)
{
	if(g.size()==1) return upd(x,g[0]);
	shuffle(g.begin(),g.end(),rnd);
	bs g1,G;int m=g.size()/2,res;
	for(int i=0;i<m;i++) g1.push_back(g[i]);res=ask(x,g1);
	for(int i:g)
	{
		int s=m;for(int j:g1) s+=dis(i,j);
		if(s==res) G.push_back(i);
	}sol(x,G);
}
void solver(int n0,int A,int B)
{
	n=n0;int rt=rnd()%n+1;lca[rt][rt]=rt;
	for(int i=1;i<=n;i++) if(i!=rt) g[ask(i,{rt})].push_back(i);
	for(int i=2;g[i].size();i++) for(int j:g[i]) sol(j,g[i-1]);
	for(int i=1;i<=n;i++) if(i!=rt) answer(i,fa[i]);
}