#include <bits/stdc++.h>

const int max_n = 3e5 + 5;

int n, m, nxt[max_n], lst[max_n];
std::unordered_map<int, bool> graph[max_n];

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        graph[x][y] = true;
        graph[y][x] = true;
    }
    int pos = 2;
    lst[0] = 2, lst[1] = 0, lst[2] = 1;
    nxt[2] = 0, nxt[1] = 2, nxt[0] = 1;
    for (int i = 3; i <= n; i++) {
        if (pos == 1) {
            pos = lst[0];
            lst[i] = pos, lst[nxt[pos]] = i;
            nxt[i] = nxt[pos], nxt[pos] = i;
            if (graph[pos][lst[pos]] == graph[pos][nxt[pos]]) pos = 1;
        }
        else if (pos == 1 || graph[pos][i] == graph[pos][lst[pos]]) {
            lst[i] = pos, lst[nxt[pos]] = i;
            nxt[i] = nxt[pos], nxt[pos] = i;
            if (nxt[i] && graph[i][lst[i]] == graph[i][nxt[i]]) pos = i;
            else pos = i;
        }
        else {
            nxt[i] = pos, nxt[lst[pos]] = i;
            lst[i] = lst[pos], lst[pos] = i;
            if (lst[i] && graph[i][lst[i]] == graph[i][nxt[i]]) pos = lst[i];
            else pos = i;
        }
    }
    for (int i = nxt[0]; i; i = nxt[i]) printf("%d\n", i);
    return 0;
}