#include <bits/stdc++.h>
#include "richest.h"
using namespace std;
int solve0(){
    vector<int> aska,askb,resp;
    int cnt=0;
    for(int i=0;i<1000;++i) for(int j=i+1;j<1000;++j){
        aska.push_back(i),askb.push_back(j),++cnt;
    }
    resp=ask(aska,askb);
    vector<int> out(1000),ans;
    for(int i=0;i<cnt;++i){
        if(resp[i]==aska[i]) out[askb[i]]++;
        else out[aska[i]]++;
    }
    for(int i=0;i<1000;++i) if(out[i]==0) return i;
    return -1;
}
int solve1(){
    vector<int> asks,aske;
    for(int i=0;i<1e6;++i) asks.push_back(i);
    int alea[]={2,2,2,2,2,2,3,15,348};
    for(int k:alea){
        int n=asks.size(),m;
        vector<int> aska,askb,repd;
        map<int,int> out;
        for(int i=0;i<n;++i) for(int j=i+1;j<n;++j){
            if(i/k!=j/k) break;
            aska.push_back(asks[i]),askb.push_back(asks[j]);
        }
        repd=ask(aska,askb);
        m=repd.size();
        for(int i=0;i<m;++i){
            if(repd[i]==aska[i]) out[askb[i]]++;
            else out[aska[i]]++;
        }
        aske.clear();
        for(int i=0;i<n;++i) if(out[asks[i]]==0) aske.push_back(asks[i]);
        asks=aske;
        out.clear();
    }
    return asks[0];
}
int richest(int n,int t,int s){
    if(n==1000) return solve0();
    else return solve1();
}