#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

const int N=5e4;
const int M=1e5;

int vf[2*M+1], urm[2*M+1];
int lst[N+1], nr, h;
bool viz[N+1];
vector <int> q;

struct element
{
    int vf, urm;
}v[M + 1];

void adauga(int x, int y)
{
    v[++nr].vf = y;
    v[nr].urm = lst[x];
    lst[x] = nr;
}

void dfs(int x)
{
    viz[x] = true;
    for(int p = lst[x]; p != 0; p = v[p].urm)
    {
        int y = v[p].vf;
        if(!viz[y])
            dfs(y);
    }
    q.push_back(x);
}

int main()
{
    int n, m;
    cin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x, y;
        cin >> x >> y;
        adauga(x, y);
        adauga(y, x);
    }

    for(int i=1; i<=n; i++)
    {
        if(!viz[i])
            dfs(i);
    }
    reverse(q.begin(), q.end());
    for (auto it = q.begin(); it != q.end(); it++)
        cout << *it << " ";
    return 0;
}