#include "richest.h"
#include<bits/stdc++.h>
using namespace std;mt19937 R(time(0));
vector<int>now,a,b,tmp,to;map<int,int>cnt;int tot,Tot;
void sol0(){cnt.clear(),a.clear(),b.clear();int len=now.size();
	for(int i=0;i<len;i++)for(int j=i+1;j<len;j++)
		a.push_back(now[i]),b.push_back(now[j]);
	tmp=ask(a,b),now.resize(1);for(auto i:tmp)cnt[i]++;
	for(auto i:cnt)if(i.second==len-1)return now[0]=i.first,void();
}
void sol1(int len,int x){
	while(tot<x){a.clear(),b.clear(),tmp.clear(),to.clear();
    	shuffle(now.begin(),now.end(),R),tot++;
		vector<int>id(now.size());
    	for(int i=0;i<now.size();i++)id[i]=i/len+1;
    	for(int i=0;i<=id.back();i++){
    		int l=i*len,r=min(i*len+len,(int)now.size())-1; 
			for(int x=l;x<=r;x++)for(int y=x+1;y<=r;y++)
				a.push_back(now[x]),b.push_back(now[y]);
		}Tot+=a.size(),tmp=ask(a,b);int num=0;
		for(int i=0;i<=id.back();i++){cnt.clear();
    		int l=i*len,r=min(i*len+len,(int)now.size())-1; 
			for(int x=l;x<=r;x++)for(int y=x+1;y<=r;y++)
				cnt[tmp[num++]]++;
			for(int j=l;j<=r;j++)if(cnt[now[j]]==r-l)to.push_back(now[j]);
		}now=to;
	}//cerr<<now.size()<<" "<<Tot<<"\n";
}
int richest(int N,int T,int S){now.clear(),Tot=tot=0;
	if(T==1){for(int i=0;i<N;i++)now.push_back(i);return sol0(),now[0];}
	for(int i=0;i<N;i++)now.push_back(i);
	sol1(2,3),sol1(3,5),sol1(6,6),sol1(10,8);
	return sol0(),now[0];
}