#include "richest.h"
# include <bits/stdc++.h>
# define ll long long
# define fi first
# define se second
# define pii pair<int, int>
using namespace std;

int richest(int N, int T, int S) {
    vector<int> as1, as2;
    vector<int> gt;
    as1.clear();
    as2.clear();
    for(int i=0;i<N-1;i++) {
        for(int k=i+1;k<N;k++) {
            as1.push_back(i);
            as2.push_back(k);
        }
    }
    gt = ask(as1, as2);
    vector<bool> pos(N + 1, 1);
    int v = 0;
    for(int i=0;i<N-1;i++) {
        for(int k=i+1;k<N;k++) {
            if(gt[v] == i) pos[k] = 0;
            else pos[i] = 0;
            v++;
        }
    }

    for(int i=0;i<N;i++) if(pos[i]) return i;
        return 0;
}