#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#define DEBUG(...) debug(#__VA_ARGS__, __VA_ARGS__)
#else
#define DEBUG(...) 6
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) {return os << "(" << p.first << ", " << p.second << ")";}
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) {bool f = true; os << "["; for (const auto &x : c) {if (!f) os << ", "; f = false; os << x;} return os << "]";}
template<typename T> void debug(string s, T x) {cerr << s << " = " << x << "\n";}
template <typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i=0, b=0; i<(int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++; else
if (s[i] == ')' || s[i] == '}') b--; else if (s[i] == ',' && b == 0) {cerr << s.substr(0, i) << " = " << x << " | "; debug(s.substr(s.find_first_not_of(' ', i + 1)), args...); break;}}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());
    // mt19937 rng(6);

    int n, m;
    cin >> n >> m;
    vector<vector<int>> adj(n);
    vector<vector<bool>> mat(n, vector<bool>(n));
    for (int i=0; i<m; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
        mat[u][v] = mat[v][u] = true;
    }

    if (n <= 20) {
        auto solve = [&] (auto &self, int u, int mask) -> bool {
            if (mask == (1 << n) - 1) {
                if (u == 0) {
                    cout << u + 1 << " ";
                    return true;
                }
                return false;
            }
            for (int v : adj[u])
                if (~mask & (1 << v) && self(self, v, mask | (1 << v))) {
                    cout << u + 1 << " ";
                    return true;
                }
            return false;
        };
        solve(solve, 0, 0);
        cout << "\n";
        return 0;
    }

    for (int rep=0; rep<100; rep++) {
        vector<int> ret(n);
        iota(ret.begin() + 1, ret.end(), 1);
        shuffle(ret.begin() + 1, ret.end(), rng);
        ret.push_back(0);
        bool done = false;
        if (rep == 99)
            done = true;
        while (!done) {
            done = true;
            for (int i=0; i<n; i++)
                if (!mat[ret[i]][ret[i+1]]) {
                    bool ok = false;
                    for (int j=i+1; j<n; j++)
                        if (mat[ret[j]][ret[j+1]] && mat[ret[i]][ret[j]] && mat[ret[i+1]][ret[j+1]]) {
                            reverse(ret.begin() + i + 1, ret.begin() + j + 1);
                            ok = true;
                            break;
                        }
                    if (!ok) {
                        for (int j=0; j+1<i; j++)
                            if (mat[ret[j]][ret[j+1]] && mat[ret[i]][ret[j]] && mat[ret[i+1]][ret[j+1]]) {
                                int l = i + 1, r = j;
                                vector<bool> vis(n);
                                while (!vis[l] && !vis[r]) {
                                    swap(ret[l], ret[r]);
                                    vis[l] = vis[r] = true;
                                    if (++l == n)
                                        l = 0;
                                    if (--r == -1)
                                        r = n - 1;
                                }
                                ret[n] = ret[0];
                                ok = true;
                                break;
                            }
                        if (!ok)
                            goto fail;
                    }
                    done = false;
                }
        }
        for (int i=0; i<=n; i++)
            cout << ret[i] + 1 << " ";
        cout << "\n";
        return 0;
        fail:;
    }

    return 0;
}