#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 = 1e5 + 100, M = 4096 + 10, len = 1e5, inf = 1e18;
const ll mod = 1e9 + 7;
namespace {
int var = 1;
} // namespace
bool was[N];
void Solve(int n, int m) {
for(int mask = 0; mask < (1 << n * m); mask++){
vector <int> vec;
for(int dig = 0; dig < n * m; dig++){
if(was[dig]) continue;
if((mask & (1 << dig)) > 0) vec.pb(dig + 1);
}
if((int)vec.size() == 4){
var =Query(vec);
if(var == 1){
for(int i = 0; i < (int)vec.size(); i++){
was[vec[i]] = true;
}
Answer(vec);
}
}
}
}
