#include <bits/stdc++.h>
//#include <windows.h>
using namespace std;
#include "richest.h"
#define rep(i, a, b) for(int i = a; i <= b; i++)
using vec = vector<int>;
using ll = long long int;
constexpr int maxn = 2e6 + 10;
#define ps push_back
vec p, np, a, b; int n, t, s, cnt[maxn];
int qry(int l, int r) {
	if (l == r) return p[l];
	a.clear(); b.clear();
	for (int i = l; i < r; i++) {
		for (int j = i + 1; j <= r; j++) a.ps(p[i]), b.ps(p[j]); 
	}
	vec c = ask(a, b); int ans = 0;
	for (int i = 0; i < c.size(); i++) {
		++cnt[c[i]];
		if (cnt[c[i]] == r - l) ans = c[i];
	}
	for (int i = 0; i < c.size(); i++) --cnt[c[i]];
	a.clear(); b.clear();
	return ans;
}
void qwq(int l, int r) {
	for (int i = l; i < r; i++) {
		for (int j = i + 1; j <= r; j++) a.ps(p[i]), b.ps(p[j]); 
	}
}
void divide(int k) {
	for (int i = 0; i < n; i += k) {
		int j = min(i + k - 1, n - 1);
		qwq(i, j);
	}
	vec c = ask(a, b); int L = 0;
	for (int i = 0; i < n; i += k) {
		int j = min(i + k - 1, n - 1);
		int len = j - i + 1;
		if (len == 1) { np.ps(p[i]); continue; }
		int wx = len * (len - 1) / 2;
		int R = L + wx - 1, ans = p[i];
		for (int k = L; k <= R; k++) {
			++cnt[c[k]];
			if (cnt[c[k]] == len - 1) ans = c[k];
		}
		for (int k = L; k <= R; k++) --cnt[c[k]];
		np.ps(ans); L = R + 1;
	}
	p = np; n = p.size(); np.clear(); a.clear(); b.clear(); 
}
int richest(int N, int T, int S) {
	n = N, t = T, s = S; p.clear(); np.clear();
	for (int i = 0; i < n; i++) p.ps(i);
	for (int i = 1; i < t; i++) if (n >= 2) divide(2);
	//for (int i = 0; i < n; i++) cerr << p[i] << " "; cerr << "\n";
	//Sleep(5000);
	return qry(0, n - 1);
}