#include "fun.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

typedef long long ll;
typedef double lf;

using namespace std;

const int MAXN = 1e5 + 10;

int n, q;
vector <int> res;

map <pair <int, int>, int> dist, tsz;
inline int GetDist(int u, int v)
{
    if (dist[make_pair(u, v)]) return dist[make_pair(u, v)];
    return dist[make_pair(u, v)] = dist[make_pair(v, u)] = hoursRequired(u - 1, v - 1);
}
inline int GetSize(int u, int v)
{
    if (tsz[make_pair(u, v)]) return tsz[make_pair(u, v)];
    return tsz[make_pair(u, v)] = attractionsBehind(u - 1, v - 1);
}

namespace Solution1
{
    vector <int> tr[MAXN];
    bool vis[MAXN];
    int pt, mx;
    void DFS(int u, int fa, int d)
    {
        if (mx < d) mx = d, pt = u;
        for (auto v : tr[u])
            if (v != fa && !vis[v]) DFS(v, u, d + 1);
    }
    int st[MAXN], top;
    bool ban;
    inline void Solve()
    {
        if (!ban)
        {
            for (int i = 1; i <= n; i++)
                for (int j = i + 1; j <= n; j++)
                    if (GetDist(i, j) == 1) tr[i].push_back(j), tr[j].push_back(i);
        }
        mx = pt = 0, DFS(1, 0, 0);
        st[top = 1] = pt, vis[st[top]] = 1;
        while (top < n)
        {
            mx = pt = 0, DFS(st[top], 0, 0);
            st[++top] = pt, vis[st[top]] = 1;
        }
        for (int i = 1; i <= top; i++) res.push_back(st[i] - 1);
    }
}

vector <int> createFunTour(int N, int Q)
{
    n = N, q = Q;
    if (n * (n - 1) / 2 <= q) Solution1::Solve();
    return res;
}