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

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

int n, m;
queue<int> q;
vector<vector<int>> G;
vector<bool> s;
vector<int> sol;
vector<int> gr;
int x, y;

void DF( int k );

int main()
{
    is >> n >> m;
    G.resize(n+1);
    s.resize(n+1);
    sol.resize(n+1);
    gr.resize(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 )
        {
            DF(i);
            q.push(i);
            int cnt = n;
            while( !q.empty() )
            {
                sol[cnt] = q.front();
                cnt--;
                q.pop();
            }
            break;
        }
    for ( int i = 1; i <= n; i++ )
        os << sol[i] << ' ';
    is.close();
    os.close();
    return 0;
}

void DF( int k )
{
    s[k] = true;
    for ( const auto& y : G[k] )
        if ( s[y] == false )
        {
            DF(y);
            q.push(y);
        }
}