#include "richest.h"
#include <bits/stdc++.h>
using namespace std;
int richest(int n,int t,int s){
	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;
	}
	int cc = 0;
	vector <int> now,tmp;
	for (int i = 0;i < n;i += 1) now.emplace_back(i);
	for (int i = 0;i < 19;i += 1){
		vector <int> a,b,c;
		for (int j = 0;j < n;j += 2) a.emplace_back(now[j]),b.emplace_back(now[j + 1]);
		cc += a.size();
		c = ask(a,b),swap(now,c),n = now.size();
	}
//	for (int i = 0;i < 1;i += 1){
//		vector <int> a,b,c,tmp;
//		for (int j = 0;j < n - 3;j += 4){
//			a.emplace_back(now[j]),b.emplace_back(now[j + 1]);
//			a.emplace_back(now[j + 2]),b.emplace_back(now[j + 3]);
//			a.emplace_back(now[j]),b.emplace_back(now[j + 2]);
//			a.emplace_back(now[j + 1]),b.emplace_back(now[j + 3]);
//		}
//		cc += a.size();
//		c = ask(a,b);
//		for (int j = 0,qwq = 0;j < n - 3;j += 4,qwq += 4){
//			if (c[qwq] == now[j] && c[qwq + 1] == now[j + 2]) tmp.emplace_back(c[qwq + 2]);
//			else if (c[qwq] == now[j + 1] && c[qwq + 1] == now[j + 3]) tmp.emplace_back(c[qwq + 3]);
//			else tmp.emplace_back(c[qwq]),tmp.emplace_back(c[qwq + 1]);
//		}
//		swap(tmp,now),n = now.size();
//	}
//	for (int i = 0;i < 4;i += 1){
//		vector <int> a,b,c,tmp;
//		for (int j = 0;j < n - 3;j += 4){
//			a.emplace_back(now[j]),b.emplace_back(now[j + 1]);
//			a.emplace_back(now[j + 2]),b.emplace_back(now[j + 3]);
//			a.emplace_back(now[j]),b.emplace_back(now[j + 2]);
//			a.emplace_back(now[j + 1]),b.emplace_back(now[j + 3]);
//			a.emplace_back(now[j]),b.emplace_back(now[j + 3]);
//		}
//		cc += a.size();
//		c = ask(a,b);
//		for (int j = 0,qwq = 0;j < n - 3;j += 4,qwq += 5){
//			if (c[qwq] == now[j] && c[qwq + 1] == now[j + 2]) tmp.emplace_back(c[qwq + 2]);
//			else if (c[qwq] == now[j + 1] && c[qwq + 1] == now[j + 3]) tmp.emplace_back(c[qwq + 3]);
//			else if (c[qwq] == now[j] && c[qwq + 1] == now[j + 3]) tmp.emplace_back(c[qwq + 4]);
//			else tmp.emplace_back(c[qwq]),tmp.emplace_back(c[qwq + 1]);
//		}
//		swap(tmp,now),n = now.size();
//	}
	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(now[i]),b.emplace_back(now[j]);
	cc += a.size();
	c = ask(a,b);
	map <int,int> cnt;
	for (int i = 0;i < c.size();i += 1) cnt[c[i]] += 1;
	for (int i = 0;i < n;i += 1) if (cnt[now[i]] == n - 1) return now[i];
	return 0;
}