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

int richest(int n, int t, int s){
  int block=sqrt(n);
  vector<int> vec[block];
  for(int i=0; i<n; i++) vec[i%block].push_back(i);
  int lastguess[block];
  int found[block], cnt=0;
  memset(found, 0, sizeof found);
  vector<int> query1, query2, result;
  while(cnt<block){
    query1.clear(), query2.clear(), result.clear();
    for(int i=0; i<block; i++){
      if(found[i]) continue;
      lastguess[i]=vec[i][0];
      for(int j=1; j<vec[i].size(); j++){
        query1.push_back(vec[i][0]);
        query2.push_back(vec[i][j]);
      }
    }
    if(!query1.empty()) result=ask(query1, query2);
    for(int i=0; i<block; i++) vec[i].clear();
    for(auto i: result) if(i!=lastguess[i%block]) vec[i%block].push_back(i);
    for(int i=0; i<block; i++) if(vec[i].empty()) found[i]=1, cnt++;
  }
  vector<int> final;
  for(int i=0; i<block; i++) final.push_back(lastguess[i]);
  query1.clear(), query2.clear(), result.clear();
  for(int i=0; i<block; i++){
    for(int j=0; j<i; j++) query1.push_back(final[i]), query2.push_back(final[j]);
  }
  result=ask(query1, query2);
  int isless[n];
  memset(isless, 0, sizeof isless);
  for(int i=0; i<query1.size(); i++){
    if(result[i]==query1[i]) isless[query2[i]]=1;
    else isless[query1[i]]=1;
  }
  for(auto i: result) if(!isless[i]) return i;
  return -1;
}