#include <bits/stdc++.h>
#include "richest.h"
using namespace std;

int richest(int n, int t, int s) {
	if(t == 1){
		vector<int> a,b,c;
		set<int> nums;
		for(int i = 0;i < n;i++){
			for(int j = i+1;j < n;j++){
				a.push_back(i);
				b.push_back(j);
			}
			nums.insert(i);
		}
		c = ask(a,b);
		for(int i = 0;i < c.size();i++){
			if(c[i] != a[i]){
				nums.erase(a[i]);
			}else{
				nums.erase(b[i]);
			}
		}
		assert(nums.size() == 1);
		return *nums.begin();
	}
	vector<int> nums;
	for(int i = 0;i < n;i++){
		nums.push_back(i);
	}
	while(t--){
		vector<int> arr[2];
		for(int i = 0;i < nums.size();i++){
			arr[i&1].push_back(nums[i]);
		}
		if(arr[0].size() != arr[1].size()){
			arr[1].push_back(nums[0]);
		}
		nums = ask(arr[0],arr[1]);
	}
    return nums[0];
}