#include "dango3.h"
#include "bits/stdc++.h"
using namespace std;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
void dnc(int cnt, vector<int> cand) {
if (cnt == 1) {
Answer(cand);
return;
}
int mid = (cnt + 1) / 2;
vector<bool> vis((int)cand.size());
vector<int> le;
vector<int> ri;
for (int i = 0; i < (int)cand.size(); ++i) {
vector<int> ask;
for (int j = 0; j < (int)cand.size(); ++j) {
if (i != j and !vis[j]) {
ask.push_back(cand[j]);
}
}
if (Query(ask) >= mid) {
vis[i] = 1;
ri.push_back(cand[i]);
} else {
le.push_back(cand[i]);
}
}
dnc(mid, le);
dnc(cnt - mid, ri);
}
void Solve(int N, int M) {
vector<int> cand(N * M);
iota(cand.begin(), cand.end(), 1);
dnc(M, cand);
}
