#include<bits/stdc++.h>
#define N 2000
#define eb emplace_back
using namespace std;
int ask(int u,std::vector<int>v);
void answer(int u,int v);
vector<int>d[N],v;
int rt;
void solve(vector<int>a,vector<int>b){
	if(!a.size()||!b.size())return;
	if(a.size()==1){
		for(int i=0;i<b.size();i++) 
		answer(a[0],b[i]);return;
	}v.clear();
	vector<int>a1,b1;vector<pair<int,int>>s;
	for(int i=0;i<a.size();i++)
	if(rand()&1)v.eb(a[i]);
	for(int i=0;i<a.size();i++)s.eb(ask(a[i],v)+v.size(),a[i]);
	for(int i=0;i<b.size();i++)s.eb(ask(b[i],v),b[i]+N);
	sort(s.begin(),s.end());
	for(int i=0;i<s.size();i++){
		if(i!=0&&s[i].first!=s[i-1].first)
		{solve(a1,b1);a1.clear();b1.clear();}
		if(s[i].second<=N)a1.eb(s[i].second);
		else b1.eb(s[i].second-N);
	}solve(a1,b1);
}
void solver(int n,int A,int B){
	rt=rand()%n+1;v.eb(rt);
	for(int i=1;i<=n;i++)
	if(i!=rt)d[ask(i,v)].eb(i);
	for(int i=0;i<n;i++)
	solve(d[i],d[i+1]);
}