#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
#include "fun.h"
// int hoursRequired(int x, int y){
// return 0;
// }
vector<int> createFunTour(int n, int q){
vector<int> ans;
pair<int,int> ma = make_pair(0, 0);
for(int i = 1; i < n; ++i) {
maximize(ma, make_pair(hoursRequired(0, i), i));
}
ans.push_back(ma.second);
vector<bool> mark(n); mark[ans[0]] = 1;
for(int it = 1; it < n; ++it){
pair<int, int> ma = make_pair(0, 0);
for(int i = 0; i < n; ++i) if (mark[i] == 0)
maximize(ma, make_pair(hoursRequired(ans.back(), i), i));
mark[ma.second] = 1;
ans.push_back(ma.second);
}
return ans;
}
// int main(void){
// ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
// clock_t start = clock();
// cerr << "Time elapsed: " << clock() - start << "ms!\n";
// return 0;
// }
