#include "richest.h"
#include <bits/stdc++.h>
using namespace std;
void work(int &n,int x,vector <int> &now){
	vector <int> a,b,c,tmp;
	for (int j = 0;j < n - x + 1;j += x){
		for (int k = 0;k < x;k += 1) for (int l = k + 1;l < x;l += 1){
			a.emplace_back(now[j + k]);
			b.emplace_back(now[j + l]);
		}
	}
	for (int j = n / x * x;j < n;j += 1) tmp.emplace_back(now[j]);
	c = ask(a,b);
	map <int,int> cnt;
	for (int j = 0,qwq = 0;j < n - x + 1;j += x,qwq += x * (x - 1) / 2){
		for (int k = 0;k < x * (x - 1) / 2;k += 1) cnt[c[qwq + k]] += 1;
		for (int k = 0;k < x;k += 1) if (cnt[now[j + k]] == x - 1){tmp.emplace_back(now[j + k]); break;}
	}
	swap(tmp,now),n = now.size();
}
int richest(int n,int t,int s){
	vector <int> a;
	for (int i = 0;i < n;i += 1) a.emplace_back(i);
	if (n == 1000) work(n,n,a);
	else work(n,2,a),work(n,2,a),work(n,2,a),work(n,2,a),work(n,3,a),work(n,6,a),work(n,19,a),work(n,n,a);
	return a[0];
}