#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)
using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;
//Note to self: Check for overflow
#include "fun.h"
int n;
int dist[503][503];
bool active[503];
int mostdist(int p)
{
int ret=p;
ff(i,0,n) if (active[i] && dist[p][i]>dist[p][ret]) ret=i;
return ret;
}
vector<int> createFunTour(int N,int q)
{
n=N;
ff(i,0,n) ff(j,i+1,n) dist[i][j]=hoursRequired(i,j),dist[j][i]=dist[i][j];
vector<int> ans;
ff(i,0,n) active[i]=true;
int x=0;
while(true)
{
x=mostdist(x);
ans.pb(x),active[x]=false;
if ((int)ans.size()==n) return ans;
}
}
//Note to self: Check for overflow
