#include <fstream>
#include <vector>
#include <stack>
#include <bitset>
using namespace std;

ifstream is("sortaret.in");
ofstream os("sortaret.out");

int n, m, a, b;
bitset<50001> ok;
vector<vector<int>> g;
stack<int> s;

void DF(int k);

int main()
{
    is >> n >> m;
    g.resize(n + 1);
    for ( int i = 1; i <= m; ++i )
    {
        is >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    for ( int i = 1; i <= n; ++i )
        if ( !ok[i] )
            DF(i);
    while ( !s.empty() )
    {
        os << s.top() << " ";
        s.pop();
    }
    is.close();
    os.close();
    return 0;
}

void DF(int k)
{
    ok[k] = true;
    for ( auto i : g[k] )
        if ( !ok[i] )
            DF(i);
    s.push(k);
}