#include"richest.h"
#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=1e6+10;
vector<int>solve(vector<vector<int>>a){
	vector<int>p,q;
	for(auto &b:a){
		for(int i=0;i<b.size();i++){
			for(int j=0;j<i;j++){
				p.push_back(b[i]),q.push_back(b[j]);
			}
		}
	}
	auto res=ask(p,q);
	int cur=0;
	vector<int>ans;
	for(auto &b:a){
		vector<int>cnt(b.size(),0);
		static int pos[N];
		for(int i=0;i<b.size();i++)pos[b[i]]=i;
		for(int i=0;i<b.size();i++){
			for(int j=0;j<i;j++){
				cnt[pos[res[cur++]]]++;
			}
		}
		ans.push_back(b[max_element(all(cnt))-cnt.begin()]);
	}
	return ans;
}
int richest(int n,int T,int S){
	vector<int>a(n);
	iota(all(a),0);
	if(n==1000){
		auto res=solve({a});
		return res[0];
	}
	for(int T=4;T--;){
		vector<vector<int>>b;
		for(int i=0;i<a.size();i+=2){
			b.push_back({a[i],a[i+1]});
		}
		a=solve(b);
		debug(T,a.size());
	}
	for(int x:{3,6,19}){
		vector<vector<int>>b;
		for(int i=0;i<a.size();){
			int k=x;
			if(x==3)k+=(a.size()-i)%x>0;
			if(x==6)k+=(a.size()-i)%x>0;
			if(x==19)k-=(a.size()-i)%x>0;
			vector<int>c;
			for(int j=0;j<k;j++)c.push_back(a[i+j]);
			b.push_back(c);
			i+=k;
		}
		a=solve(b);
		debug(x,a.size());
	}
	auto res=solve({a});
	return res[0];
}
#ifdef DEBUG
#include"debug.hpp"
#endif