#include <bits/stdc++.h>

using namespace std;
vector<vector<int> > G;
vector<bool> used;
vector<int> answer;

void DFS(int k) {
    used[k] = true;
    for (auto it : G[k])
        if (!used[it])
            DFS(it);
    answer.emplace_back(k);
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    int N, M;
    scanf("%d%d", &N, &M);
    G.resize(N + 1);
    used.resize(N + 1);
    for (int i = 1; i <= M; ++i) {
        int a,b;
        scanf("%d%d", &a, &b);
        G[a].emplace_back(b);
        G[b].emplace_back(a);
    }

    for (int i = 1; i <= N; ++i)
        if(!used[i])
            DFS(i);
    reverse(answer.begin(), answer.end());
    for (auto it : answer)
        cout << it << " ";

    return 0;
}