#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define randfind(l,r) (rand()%((r)-(l)+1)+(l))
using namespace std;
int ask(int u,std::vector<int>v);
void answer(int u,int v);
const int Maxn=1e3+10;
int dep[Maxn];
vector<int> vc[Maxn];
inline int ask1(int x,int y){
    vector<int> now;now.clear();
    now.push_back(y);
    int tot;tot=ask(x,now);
    if(tot==1) return true;
    return false;
}
struct node{
    int dis;
    int pos;
}e1[Maxn],e2[Maxn];
inline bool cmp(node a,node b){return a.dis<b.dis;}
inline void solve(vector<int> a,vector<int> b){
    // printf("solve:\n");
    // for(register int i=0;i<a.size();++i) cout<<a[i]<<' ';
    // puts("");
    // for(register int i=0;i<b.size();++i) cout<<b[i]<<' ';
    // puts("");
    if(a.size()==1){
        for(register int i=0;i<b.size();++i) answer(a[0],b[i]);
        return;
    }
    if(b.size()==1){
        for(register int i=0;i<a.size();++i) if(ask1(a[i],b[0])){
            answer(a[i],b[0]);
            return;
        }
    }
    vector<int> now;now.clear();
    if(a.size()>10){
        while(now.size()<a.size()/5 || now.size()>a.size()*3/5 || now.size()==a.size() || now.size()==0){
            for(register int i=0;i<a.size();++i){
                int x;
                x=randfind(1,12);
                if(x%4==0) now.push_back(a[i]);
            }
        }
    }
    else {
        while(now.size()==a.size() || now.size()==0){
            for(register int i=0;i<a.size();++i){
                int x;
                x=randfind(1,12);
                if(x%4==0) now.push_back(a[i]);
            }
        }
    }
    int cnt1,cnt2;
    cnt1=cnt2=0;
    // printf("important:\n");
    // for(register int i=0;i<now.size();++i) cout<<now[i]<<' ';
    // puts("");
    for(register int i=0;i<a.size();++i){
        e1[++cnt1].pos=a[i];
        e1[cnt1].dis=ask(a[i],now);
    }
    for(register int i=0;i<b.size();++i){
        e2[++cnt2].pos=b[i];
        e2[cnt2].dis=ask(b[i],now);
    }
    sort(e1+1,e1+cnt1+1,cmp);
    sort(e2+1,e2+cnt2+1,cmp);
    int l,r;
    l=r=1;
    int ql,qr;
    ql=1;
    while(l<=cnt1 && ql<=cnt2){
        r=l;
        while(r<cnt1 && e1[r+1].dis==e1[l].dis) ++r;
        while(ql<cnt2 && e2[ql].dis<e1[l].dis+now.size()) ++ql;
        qr=ql;
        while(qr<cnt2 && e2[qr+1].dis==e2[ql].dis) ++qr;
        if(ql<=qr){
            vector<int> p1,p2;
            p1.clear();p2.clear();
            fr(i,l,r) p1.push_back(e1[i].pos);
            fr(i,ql,qr) p2.push_back(e2[i].pos);
            solve(p1,p2);
        }
        l=r+1;ql=qr+1;
    }
}
void solver(int n,int A,int B){
    srand(time(0));
    vector<int> now;now.clear();
    now.push_back(1);
    dep[1]=1;
    fr(i,2,n) dep[i]=ask(i,now)+1;
    fr(i,1,n) vc[dep[i]].push_back(i);
    fr(i,1,n) if(vc[i].size() && vc[i+1].size()) solve(vc[i],vc[i+1]);
}