#include <bits/stdc++.h>
#define DimMax 50000
using namespace std;

ifstream fin ( "sortareret.in" );
ofstream fout ( "sortareret.out" );

int n, m;
int u, v;
int ans[DimMax + 1];
int g[DimMax + 1];
vector<int> adj[DimMax + 1];
queue<int> q;

int main()
{
    fin >> n >> m;
    for ( int i = 1; i <= m; i++ )
    {
        fin >> u >> v;
        g[v]++;
        adj[u].push_back(v);
    }
    for ( int i = 1; i <= n; i++ )
        if ( g[i] == 0 ) q.push(i);

    while ( !q.empty() )
    {
        int v = q.front();
        q.pop();
        ans[++ans[0]] = v;
        for ( auto u: adj[v] )
        {
            g[u]--;
            if ( g[u] == 0 ) q.push(u);
        }
    }
    for ( int i = 1; i <= ans[0]; i++ )
        fout << ans[i] << " ";
    return 0;
}