#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
const int mod= 1e9 +7;
const int N=1e5*4;
void Solve(int n,int m){
vector<int>v(n*m);
iota(all(v),1);
queue<pair<vector<int>,int>>q;
q.push({v,m});
while(!q.empty()){
auto [g,sz] = q.front();
q.pop();
int pl = g.size();
if(sz==1){
Answer(g);
continue;
}
vector<int>vs;
for(int i = 0;i<pl;i++){
vs.pb(g[0]);
g.erase(g.begin());
int x = Query(g);
if(x<sz/2){
g.pb(vs.back());
vs.pop_back();
}
}
q.push({g,sz/2});
q.push({vs,sz-sz/2});
}
}
