#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;
for (int x = 0; x < N; x ++){
for (int y = x+1; y < N; y ++){
a.push_back(x);
b.push_back(y);
}
}
vector<int> c = ask(a, b);
int ma = 0;
int check = 0, cur = 0;
for (int x = 1; x < N; x ++){
cur += N-x;
if (c[check + x-ma-1] == x){
ma = x;
check = cur;
}
}
return ma;
}else {
vector<int> rem;
for (int x = 0; x < N; x ++){
rem.push_back(x);
}
vector<int> a, b, c;
for (int x = 0; x < 20; x ++){
if (rem.size() == 1){
break;
}
for (int i = 0; i <= rem.size()/2; i ++){
a.push_back(rem[2*i]);
b.push_back(rem[(2*i+1) % rem.size()]);
}
c = ask(a, b);
vector<int> nextRem;
if (rem.size() % 2 == 1){
if (c[0] == c.back()){
nextRem.push_back(rem[0]);
}else if (c[0] == rem[0]){
nextRem.push_back(rem.back());
}else if (c.back() == rem[0]){
nextRem.push_back(rem[1]);
}else {
nextRem.push_back(rem.back());
nextRem.push_back(rem[1]);
}
}else {
if (c[0] == rem[2*i]){
nextRem.push_back(rem[2*i]);
}else {
nextRem.push_back(rem[2*i + 1]);
}
}
for (int i = 1; i < rem.size()/2; i ++){
if (c[i] == rem[2*i]){
nextRem.push_back(rem[2*i]);
}else {
nextRem.push_back(rem[2*i + 1]);
}
}
swap(nextRem, rem);
}
return rem[0];
}
return 0;
}