#include "richest.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define pb push_back
const int N=1e6;
int richest(int n, int T, int S) {
	if(T==1){
		vi a,b;
		rep(i,1,n-1)rep(j,0,i-1)a.pb(i),b.pb(j);
		vi res=ask(a,b);
		static int cnt[1000];
		rep(i,0,n-1)cnt[i]=0;
		for(auto x:res)++cnt[x];
		rep(i,0,n-1)if(cnt[i]==n-1)return i;
	}
	const int dx[9]={1,183,3472,20832,62496,125000,250000,500000,1000000};
	vi A;rep(i,0,n-1)A.pb(i);
	per(t,8,1){
		static int cnt[N];
		rep(i,0,n-1)cnt[i]=0;
		vi a,b,B;
		int x=dx[t-1],y=dx[t],b1=y/x,b2=y%x,idx=0;
		rep(i,1,b2){
			vi c;
			rep(j,1,b1+1)c.pb(A[idx++]);
			rep(j,0,b1)rep(k,0,j-1)a.pb(c[j]),b.pb(c[k]);
		}
		rep(i,1,x-b2){
			vi c;
			rep(j,1,b1)c.pb(A[idx++]);
			rep(j,0,b1-1)rep(k,0,j-1)a.pb(c[j]),b.pb(c[k]);
		}
		vi res=ask(a,b);
		idx=0;int tp=0;
		rep(i,1,b2){
			vi c;
			rep(j,1,b1+1)c.pb(A[idx++]);
			rep(j,0,b1)rep(k,0,j-1)++cnt[res[tp]],++tp;
			for(auto x:c)if(cnt[x]==b1)B.pb(x);
		}
		rep(i,1,x-b2){
			vi c;
			rep(j,1,b1)c.pb(A[idx++]);
			rep(j,0,b1-1)rep(k,0,j-1)++cnt[res[tp]],++tp;
			for(auto x:c)if(cnt[x]==b1-1)B.pb(x);
		}
		A.swap(B);
	}
	return A[0];
}