#include "richest.h"

constexpr int MAXN = 1000 + 2;

int cnt[MAXN];

int richest(int N, int T, int S) {
    if (T == 1) {
        for (int i = 0; i < N; i ++) {
            cnt[i] = 0;
        }

        std::vector<int> v1, v2;

        for (int i = 0; i < N; i ++) {
            for (int j = i + 1; j < N; j ++) {
                v1.push_back(i);
                v2.push_back(j);
            }
        }

        std::vector<int> tmp = ask(v1, v2);

        for (int i = 0; i < tmp.size(); i ++) {
            if (tmp[i] == v1[i]) {
                cnt[v1[i]] ++;
            } else {
                cnt[v2[i]] ++;
            }
        }

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

    std::vector<int> cur;

    for (int i = 0; i < N; i ++) {
        cur.push_back(i);
    }

    while (cur.size() > 1) {
        std::vector<int> v1, v2;

        for (int i = 0; i + 1 < cur.size(); i += 2) {
            v1.push_back(cur[i]);
            v2.push_back(cur[i + 1]);
        }

        int tmp = 0;

        if (cur.size() & 1) {
            tmp = cur.back();
        }

        cur = ask(v1, v2);

        if (tmp) {
            cur.push_back(tmp);
        }
    }

    return cur[0];
}