#include<bits/stdc++.h>
using namespace std;
std::vector<int> ask(std::vector<int> a, std::vector<int> b);
int richest(int N, int T, int S)
{
	vector<int>now,v;
	now.clear();v.clear();
	v.resize(N+1,0);
	for(int i=1;i<=N;i++)
	now.push_back(i);
	for(int p=1;p<T;p++)
	{
		vector<int>a,b;
		a.clear(),b.clear();
		int t=0;
		for(auto u:now)
		{
			if(t)
			b.push_back(u-1);
			else
			a.push_back(u-1);
			t^=1;
		}
		a.resize(min(a.size(),b.size()));
		b.resize(min(a.size(),b.size()));
		vector<int>c=ask(a,b);
		for(int i=0;i<c.size();i++)
		{
			v[(a[i]^b[i]^c[i])+1]=1;
		}
		vector<int>newn;
		newn.clear();
		for(auto u:now)
		if(!v[u])
		newn.push_back(u);
		now.clear();
		swap(now,newn);
	}
	vector<int>a,b;
	a.clear(),b.clear();
	for(int i=0;i<now.size();i++)
	{
		for(int j=i+1;j<now.size();j++)
		{
			a.push_back(now[i]-1);
			b.push_back(now[j]-1);
		}
	}
	vector<int> c=ask(a,b);
	for(int i=0;i<c.size();i++)
	{
		v[(a[i]^b[i]^c[i])+1]=1;
	}
	for(int i=1;i<=N;i++)
	if(!v[i])
	{
		return i-1;
	}
}