#include <bits/stdc++.h>
#include "dango3.h"
#ifdef MINA
#include "grader.cpp"
#endif
using namespace std;
#define ll long long
void Solve(int n, int m) {
vector<int> idx[n];
set<int> s;
for (int i = 1; i <= n * m; i++) {
s.insert(i);
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < m; i++) {
int l = 0, r = s.size() - 1;
while (l <= r) {
int md = ((l + r) >> 1);
int cnt = md;
vector<int> x;
for (auto k : s) {
x.push_back(k);
cnt--;
if (cnt == 0) break;
}
for (int k = 0; k < j; k++) {
x.push_back(idx[k].back());
}
int v = Query(x);
if (v == 1) {
r = md - 1;
} else {
l = md + 1;
}
}
int cnt = l, pos = -1;
for (auto k : s) {
cnt--;
pos = k;
if (cnt == 0) break;
}
s.erase(pos);
idx[j].push_back(pos);
}
}
for (int i = 0; i < m; i++) {
vector<int> ans;
for (int j = 0; j < n; j++) {
ans.push_back(idx[j].back());
idx[j].pop_back();
}
Answer(ans);
}
}
