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

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

vector<vector<int>>  g;
vector<bool> v;
vector<int> gr;
queue<int> Q;

int n, m, x, y;

int main()
{
    is >> n >> m;
    g.resize(n+1);
    gr.resize(n+1);
    v.resize(n+1);
    for  ( int i = 1; i <= m; i++ )
    {
        is >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
        gr[y]++;
    }
    for ( int i = 1; i <= n; i++ )
        if ( gr[i] == 0 )
        {
            Q.push(i);
            v[i] = true;
        }
    int k;
    while( !Q.empty() )
    {
        k = Q.front();
        Q.pop();
        os << k << ' ';
        for ( const int& f : g[k] )
            if( v[f] == false )
            {
                v[f] = true;
                Q.push(f);
            }
    }
    is.close();
    os.close();
    return 0;
}