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

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

int richest(int n,int T,int S)
{
    if(n==1000)
    {
        vector<int>is(n,1);
        vector<int>A,B;
        FOR(i,0,n-1)
        {
            FOR(j,i+1,n-1)
            {
                A.pb(i);
                B.pb(j);
            }
        }
        vector<int>W=ask(A,B);
        int it=0;
        FOR(i,0,n-1)
        {
            FOR(j,i+1,n-1)
            {
                if(W[it]!=i) is[i]=0;
                if(W[it]!=j) is[j]=0;
                it++;
            }
        }
        FOR(i,0,n-1) if(is[i]) return i;
    }
    vector<int>V(n);
    FOR(i,0,n-1) V[i]=i;
    while(sz(V)>1)
    {
        vector<int>A,B;
        for(int i=0;i+1<sz(V);i+=2)
        {
            A.pb(V[i]);
            B.pb(V[i+1]);
        }
        vector<int>nV=ask(A,B);
        if(sz(V)%2==1) nV.pb(V.back());
        V=nV;
    }
    return V[0];
}