#include <bits/stdc++.h>
#include "richest.h"
using namespace std;
const int N = 1e6 + 5;
vector <int> vec[N], num, ret, q1, q2;
int tot[N];
void work(int p, int q, int c)
{
    memset(tot, 0, sizeof(tot));
    q1.clear(); q2.clear(); int cnt = 0;
    for (int i = 1; i <= c; i++)
    {
        cnt++; vec[cnt].clear();
        for (int j = 1; j <= q; j++)
            vec[cnt].push_back(num.back()), num.pop_back();
        for (int i = 0; i < q; i++)
            for (int j = i + 1; j < q; j++)
                q1.push_back(vec[cnt][i]), q2.push_back(vec[cnt][j]);
    }
    while (!num.empty())
    {
        cnt++; vec[cnt].clear();
        for (int j = 1; j <= p; j++)
            vec[cnt].push_back(num.back()), num.pop_back();
        for (int i = 0; i < p; i++)
            for (int j = i + 1; j < p; j++)
                q1.push_back(vec[cnt][i]), q2.push_back(vec[cnt][j]);
    }
    ret = ask(q1, q2);
    for (int x : ret) tot[x]++;
    for (int i = 1; i <= cnt; i++) for (int x : vec[i])
        if (tot[x] == (int)vec[i].size() - 1) num.push_back(x);
}
int richest(int n, int T, int S)
{
    num.clear(); 
    for (int i = 0; i < n; i++) num.push_back(i);
    if (T == 1) return work(n, 0, 0), num[0];
    for (int _ = 1; _ <= 4; _++) work(2, 0, 0);
    work(3, 4, 1); work(6, 7, 1);
    work(19, 18, 5); work(183, 0, 0);
    return num[0];
}