#include <bits/stdc++.h>
#include "fun.h"
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
int dis(int a, int b) { return hoursRequired(a, b); }
int sbsz(int rt, int x) { return attractionsBehind(rt, x); }
// always go to the farthest point possible
// but it doesn't rely on deg(x) <= 3
std::vector<int> createFunTour(int N, int Q) {
vector<int> ans;
vector<int> vis(N);
assert(1ll * N * N <= Q);
auto getfar = [&](int x) {
int p = -1, d = -1;
for (int i = 0;i < N;++i)
if (x != i && !vis[i]) {
if (chmax(d, dis(x, i)))
p = i;
}
return p;
};
ans.pb(getfar(0));
for (int i = 1;i < N;++i) {
vis[ans[i-1]] = true;
ans.pb(getfar(ans[i-1]));
}
return ans;
}
