#include <bits/stdc++.h>

using namespace std;

int n, m, st[50005], viz[50005], top;
vector <int> a[50005];

void Dfs(int x)
{
    viz[x] = 1;
    for (int w : a[x])
        if (viz[w] == 0)
        Dfs(w);
    st[++top] = x;
}

int main()
{
    int i, j, x, y;
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    cin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        cin >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
    }

    for (i = 1; i <= n; i++)
        if (viz[i] == 0)
        Dfs(i);

    for (i = n; i >= 1; i--)
        cout << st[i] << " ";

    return 0;
}