#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")

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

using namespace std;

const int N = 1010;

int d[N][N];

int richest(int n, int k, int m) {
	vector <int> a, b;
	for (int i = 0; i < n; i++) {
		for (int j = i+1; j < n; j++) {
			a.push_back(i), b.push_back(j);
		}
	}
	vector <int> c = ask(a, b);
	int tot = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i+1; j < n; j++) {
			d[i][j] = (c[tot++] == i ? 0 : 1);
		}
	}
	for (int i = 0; i < n; i++) {
		bool flag = true;
		for (int j = 0; j < i; j++) {
			if (!d[j][i]) {
				flag = false; break;
			}
		}
		for (int j = i+1; j < n; j++) {
			if (d[i][j]) {
				flag = false; break;
			}
		}
		if (flag) return i;
	}
}

//int main() {
//	
//	return 0;
//}