#include "richest.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector <int> now;
void work(int x){
	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 m,int t,int s){
	n = m;
	if (n == 1000){
		map <int,int> cnt;
		vector <int> a,b,c;
		for (int i = 0;i < n;i += 1) for (int j = i + 1;j < n;j += 1) a.emplace_back(i),b.emplace_back(j);
		c = ask(a,b);
		for (int i = 0;i < c.size();i += 1) cnt[c[i]] += 1;
		for (int i = 0;i < n;i += 1) if (cnt[i] == n - 1) return i;
		return 0;
	}
	for (int i = 0;i < n;i += 1) now.emplace_back(i);
	work(2),work(2),work(2),work(2),work(3),work(6),work(19),work(n);
	return now[0];
}