#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=1;i<N;i++) {
        for(int k=i+1;k<=N;k++) {
            as1.push_back(i);
            as2.push_back(k);
        }
    }
    gt = ask(as1, as2);
    vector<vector<bool>> cek(N);
    for(int i=0;i<N;i++) {
        cek[i].resize(N);
        for(int k=0;k<N;k++) cek[i][k] = 0;
    }
    
    int v = 0;
    for(int c=1;c<N;c++) {
        for(int d=c+1;d<=N;d++) {
            if(gt[v] == c) cek[c - 1][d - 1] = 1;
            else cek[d - 1][c - 1] = 1;
        }
    }

    for(int i=1;i<=N;i++) {
        int ct = 0;
        for(int k=1;k<=N;k++) {
            if(cek[i - 1][k - 1]) ct++;
        }
        if(ct == N - 1) return i;
    }
}