#include <bits/stdc++.h>
#include "dango3.h"
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 400 * 25 + 100, M = 4096 + 10, len = 1e5, inf = 1e18;
const ll mod = 1e9 + 7;
namespace {
int var = 1;
} // namespace
bool was[N];
vector <int> gr[N];
void Solve(int n, int m) {
vector <int> vec;
for(int times = 1; times <= n; times++){
vector <int> vec;
for(int i = times - 1; i >= 1; i--){
vec.pb(gr[i][0]);
}
for(int i = 1; i <= n * m; i++){
if(was[i]) continue;
vec.pb(i);
if((int)vec.size() >= n){
var = Query(vec);
if(var == 1){
was[i] = true;
gr[times].pb(i);
vec.pop_back();
}
}
}
}
for(int times = 1; times <= m; times++){
vector <int> vec;
for(int i = 1; i <= n; i++){
vec.pb(gr[i].back());
gr[i].pop_back();
}
Answer(vec);
}
}
