#include<bits/stdc++.h>
#include "richest.h"
using namespace std;
mt19937 rd(5384);
int richest(int n,int T,int S) {
    if(T==1) {
        vector<int>a,b,ct(n);
        for(int i=0;i<n;i++)for(int j=i+1;j<n;j++)a.push_back(i),b.push_back(j);
        vector<int>c=ask(a,b);
        for(int i:c)ct[i]++;
        for(int i=0;i<n;i++)if(ct[i]==n-1)return i;
    }
    vector<int>a(n);
    iota(a.begin(),a.end(),0);
    while(a.size()>1) {
        shuffle(a.begin(),a.end(),rd);
        vector<int>qa,qb,qc,na,del(a.size());
        for(int i=0;i<a.size()-1;i++)qa.push_back(a[i]),qb.push_back(a[i+1]);
        qc=ask(qa,qb);
        for(int i=0;i<qc.size()-1;i++)if(qc[i]==qa[i])del[i+1]=1;else del[i]=1;
        for(int i=0;i<a.size();i++)if(!del[i])na.push_back(i);
        a=na;
    }
    return a[0];
}