#include "cstdio"
#include "algorithm"
#include "cstring"
#define maxn 500005
int n, m, stck[maxn], top, cir = 1, in[maxn], cnt;
int ans[maxn], to[maxn << 2], s[maxn], idx = 0, len = 0;
int lnk[maxn], nxt[maxn << 1], son[maxn << 1], tot = 1;
bool vis[maxn], flg[maxn];
int num = 0;
inline int read() {
    char ch = getchar();
    int ret = 0, f = 1;

    while (ch > '9' || ch < '0') {
        if (ch == '-')
            f = -1;

        ch = getchar();
    }

    while (ch >= '0' && ch <= '9')
        ret = ret * 10 + ch - '0', ch = getchar();

    return ret * f;
}
inline void add(int x, int y) {
    son[++tot] = y, nxt[tot] = lnk[x], lnk[x] = tot;
}
inline void Trump() {
    memset(flg, 1, sizeof(flg));

    for (int i = 1; i <= n; ++i)
        flg[i] = true;

    top = 0;

    for (int i = 1; i <= n; ++i)
        if (in[i] == 1)
            stck[++top] = i;

    while (top) {
        int now = stck[top--];
        flg[now] = 0, cnt--;

        for (int j = lnk[now]; j; j = nxt[j]) {
            in[son[j]]--;

            if (in[son[j]] == 1)
                stck[++top] = son[j];
        }
    }
}
inline void DFS(int now, int lst, int pre) {
    if (!vis[now]) {
        ans[++idx] = now;

        if (flg[now])
            cnt--;
    }

    vis[now] = 1;
    int l = len + 1, r = len;

    for (int j = lnk[now]; j; j = nxt[j])
        if (!vis[son[j]])
            to[++len] = son[j];

    if (len < l)
        return;

    r = len, len++;
    std::sort(to + l, to + 1 + r);

    for (s[now] = l; s[now] <= r; ++s[now])
        if (s[now] == r) {
            if (flg[to[s[now]]] && flg[now] && flg[pre] && to[s[now]] > lst && cir < 0) {
                cir = 1;
                return;
            }

            DFS(to[s[now]], lst, now);
        } else
            DFS(to[s[now]], to[s[now] + 1], now);
}
int main() {
    n = read(), m = read();

    for (int i = 1; i <= m; ++i) {
        int x = read(), y = read();
        add(x, y), add(y, x);
        in[x]++, in[y]++;
    }

    if (n == m) {
        cir = -1, cnt = n;
        Trump();
        flg[0] = true;
    }

    DFS(1, n + 1, 0);

    for (int i = 1; i <= n; ++i)
        printf("%d ", ans[i]);

    return 0;
}