#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
using ll = int;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i, l, r) for (auto i = l; i < r; i++)
#define fo(i, n) fore (i, 0, n)
#define forex(i, r, l) for (auto i = r-1; i >= l; i--)
#define ffo(i, n) forex (i, n, 0)
#define mid ((l+r)>>1)
bool cmin(ll &a, ll b) { if (b < a) { a=b; return 1; } return 0; }
bool cmax(ll &a, ll b) { if (b > a) { a=b; return 1; } return 0; }
const ll INF = 1e18;
const int N = 105;
ll myquery (vll a, vll b) {
ll n = a.size(), m = b.size();
int A[n], B[m];
fo (i, a.size()) A[i] = a[i];
fo (i, b.size()) B[i] = b[i];
return query(n, m, A, B);
}
vll graph[N];
void run (int n) {
fo (i, n-1) {
fore (a, 1, n+1) {
vll vis(n+1, 1ll), aux;
for (ll v: graph[a]) vis[v] = 0;
vis[a] = 0;
fore (b, 1, n+1) if (vis[b]) aux.pb(b);
if (myquery({a}, aux)) {
for (ll b: aux) {
if (myquery({a}, {b})) {
graph[a].pb(b);
graph[b].pb(a);
setRoad(a, b);
break;
}
}
break;
}
}
}
fo (i, n+1) graph[i].clear();
}
