// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
#include "richest.h"
using namespace std;
int solveSmall(int n,int s){//task 1 is just a n^2 brute force
//simmilar to first explore task
//surely
	vector<int> x,y;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			x.emplace_back(i),y.emplace_back(j);
		}
	}
	vector<int> z=ask(x,y),cnt(n);//ask-2005 refrence 0-0
	for(int i=0;i<n;i++){
		cnt[z[i]]++;
	}
	return distance(cnt.begin(),max_element(cnt.begin(),cnt.end()));
}
int solveLarge(int n,int s){
	return 0;
}
int richest(int n, int t,int s){
	if(t==1)return solveSmall(n,s);
	return solveLarge(n,s);
}