#include "richest.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

mt19937 rnd(time(NULL));

template<typename T>
void make_shuf(vector<T>& v) {
    for (int i = 1; i < sz(v); i++) swap(v[i], v[rnd() % (i + 1)]);
}

int richest(int N, int T, int S) {
    if (N <= 1000) {
        vector<int> a, b;
        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                a.pb(i); b.pb(j);
            }
        }
        auto rs = ask(a, b);
        vector<int> deg(N);
        for (int i = 0; i < sz(a); i++) {
            deg[rs[i]]++;
        }   
        for (int i = 0; i < N; i++) {
            if (deg[i] == N - 1) return i;
        }
        return -1;
    }

    auto make_op = [&](vector<int> guys, int parts, int secval) {
        parts = min(parts, sz(guys));
            vector<vector<int>> mns(parts);
            int cur = 0;
            for (int i = 0; i < sz(guys); i++) {
                mns[cur].pb(guys[i]);
                cur = (cur + 1 < parts ? cur + 1 : 0);
            }
            if (secval == 1) {
                for (int j = 0; j < sz(guys) % parts; j++) {
                    mns.pb({mns[j].back()});
                    mns[j].pop_back();
                }
            }
            else if (secval == 2) {
                int cnt_rows = (sz(guys) + parts - 1) / parts;
                int C = sz(guys) / cnt_rows;
                mns.assign(C + 1, {});
                int ind = 0;
                for (int g : guys) {
                    if (mns[ind].size() == cnt_rows) ind++;
                    mns[ind].pb(g);
                }
            }
            vector<int> A, B;
            vector<int> cntt(mns[0].size());
            for (int i = 0; i < mns[0].size(); i++) {
                for (int mn1 = 0; mn1 < sz(mns); mn1++) {
                    if (sz(mns[mn1]) <= i) break;
                    cntt[i]++;
                    for (int mn2 = mn1 + 1; mn2 < sz(mns); mn2++) {
                        if (sz(mns[mn1]) > i && sz(mns[mn2]) > i) {
                            A.pb(mns[mn1][i]); B.pb(mns[mn2][i]);
                        }
                    }
                }
            }
            auto rs = ask(A, B);
            vector<int> ret;
            int ind = 0;
            vector<int> deg(N);
            for (int i = 0; i < mns[0].size(); i++) {
                for (int j = ind; j < min(sz(rs), ind + (cntt[i] * (cntt[i] - 1) / 2)); j++) {
                    deg[rs[j]]++;
                }
                for (int mn1 = 0; mn1 < sz(mns); mn1++) {
                    if (sz(mns[mn1]) > i && deg[mns[mn1][i]] == cntt[i] - 1) {
                        ret.pb(mns[mn1][i]);
                        break;
                    }
                }
                ind += (cntt[i] * (cntt[i] - 1) / 2);
            }   
            return ret;
        
    }; 
    vector<int> parts = {2, 2, 2, 2, 3, 6, 19, 183};
    vector<int> val2 = {0, 0, 0, 0, 1, 1, 2, 0};
    vector<int> A(N); iota(all(A), 0);
    int curind = 0;
    for (int el : parts) {
        A = make_op(A, el, val2[curind++]);
    }
    return A[0];
}