#include<bits/stdc++.h>
#include "richest.h"
using namespace std;
const int N=1e6+3;
bitset<N>vis;
vector<int>work(vector<int>now,int K){
    vector<int>q1,q2,ret;
    int len=now.size();
    for(int i=0;i<len;i+=K)
        for(int j=i;j<min(len,i+K);++j)
            for(int k=j+1;k<min(len,i+K);++k)
                q1.push_back(now[j]),q2.push_back(now[k]);
    vector<int>res=ask(q1,q2);
    int sz=res.size();
    for(int i=0;i<sz;++i)
        if(res[i]==q1[i])vis[q2[i]]=1;
        else vis[q1[i]]=1;
    for(auto x:now)
        if(!vis[x])ret.push_back(x);
    return ret;
}
int richest(int n,int t,int s){
    vis.reset();
    vector<int>now;
    for(int i=0;i<n;++i)now.push_back(i);
    if(t==1){
        now=work(now,n);
        return now[0];
    }
    now=work(now,2);
    now=work(now,2);
    now=work(now,2);
    now=work(now,2);
    now=work(now,3);
    now=work(now,6);
    now=work(now,19);
    now=work(now,183);
    return now[0];
    return 0;
}