#include "richest.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int>pi;
int do_all(vector<int> vec){
	vector<int>A,B;
	for(int i=0;i<vec.size();i++){
		for(int j=i+1;j<vec.size();j++){
			A.push_back(vec[i]);
			B.push_back(vec[j]);
		}
	}
	vector<int>res=ask(A,B);
	map<int,int>cnt;
	int mx=0;
	for(auto x:res){
		cnt[x]++;
	}
	for(auto x:cnt)mx=max(mx,x.second);
	for(auto x:cnt){
		if(x.second==mx)return x.first;
	}
	assert(0);
}
int richest(int n, int T, int S){
	vector<int> vec;
	for(int i=0;i<n;i++){
		vec.push_back(i);
	}
	return do_all(vec);
	while(vec.size()>1){
		vector<int> A, B;
		vector<int>nvec;
		for(int i=0;i<(int)vec.size()-1;i+=2){
			A.push_back(vec[i]);
			B.push_back(vec[i+1]);
		}
		if((int)vec.size() % 2 == 1){
			nvec.push_back(vec.back());//bye
		}
		vector<int>res=ask(A,B);
		for(auto x:res){
			nvec.push_back(x);
		}
		vec=nvec;
	}
	return vec[0];
}