#include<bits/stdc++.h>
#include "richest.h"
using namespace std;
const int tr[]={1,183,3472,20832,62500,125000,250000,500000,1000000};
int richest(int N,int T,int S) {
	if(T==1) {
		vector <int> x,y;
		for(int i=0;i<N;++i) for(int j=i+1;j<N;++j) {
			x.push_back(i),y.push_back(j);
		}
		vector <int> z=ask(x,y),del(N,0);
		for(int i=0;i<(int)z.size();++i) del[x[i]+y[i]-z[i]]=1;
		for(int i=0;i<N;++i) if(!del[i]) return i;
		return -1;
	}
	vector <int> id(N); iota(id.begin(),id.end(),0);
	for(int k=8;k;--k) {
		int u=tr[k],v=tr[k-1],cur=0;
		vector <int> x,y;
		for(int i=0;i<v;++i) {
			int b=u/v+(i<u%v);
			for(int s=0;s<b;++s) for(int t=s+1;t<b;++t) {
				x.push_back(id[cur+s]);
				y.push_back(id[cur+t]);
			}
			cur+=b;
		}
		vector <int> z=ask(x,y),del(N,0),nw;
		for(int i=0;i<(int)z.size();++i) del[x[i]+y[i]-z[i]]=1;
		for(int i:id) if(!del[i]) nw.push_back(i);
		id.swap(nw);
	}
	return id[0];
}