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

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

int n, m;
int x, y, k;
vector<vector<int>> G;
vector<int> gr;
vector<bool> s;
queue<int> Q;

int main()
{
    is >> n >> m;
    G.resize(n+1);
    s = vector<bool>(n+1);
    gr = vector<int>(n+1);
    for ( int i = 1; i <= m; i++ )
    {
        is >> x >> y;
        G[x].push_back(y);
        gr[y]++;
    }
    for ( int i = 1; i <= n; i++ )
        if ( gr[i] == 0 )
            s[i] = true, Q.push(i);
    while ( !Q.empty() )
    {
        k = Q.front();
        os << k << ' ';
        Q.pop();
        for ( const auto& y : G[k] )
            if ( !s[y] )
            {
                gr[y]--;
                if ( gr[y] == 0 )
                    Q.push(y), s[y] = true;
            }
    }
    is.close();
    os.close();
    return 0;
}