#include <bits/stdc++.h>
#define NM 50005
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <vector <int>> M(NM);
stack <int> Q;
int n, m, x, y, v[NM];
void dfs(int nod)
{
    v[nod] = 1;
    for(auto it : M[nod])
        if(v[it] == 0)
            dfs(it);
    v[nod] = 2;
    Q.push(nod);
}
int main()
{
    in >> n >> m;
    for(int i = 1;i <= m;i++)
    {
        in >> x >> y;
        M[x].push_back(y);
        M[y].push_back(y);
    }
    for(int i = 1;i <= n;i++)
    {
        if(v[i] == 0)
            dfs(i);
    }
    while(!Q.empty())
    {
        out << Q.top() << " ";
        Q.pop();
    }
    return 0;
}