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

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

int n, m;
int x, y;
vector<vector<int>> G;
stack<int> a;
vector<bool> s;
void DF( int k );

int main()
{
    is >> n >> m;
    G.resize(n+1);
    s = vector<bool>(n+1);
    for ( int i = 1; i <= m; i++ )
    {
        is >> x >> y;
        G[x].push_back(y);
    }
    for ( int i = 1; i <= n; i++ )
        if ( !s[i] )
            DF(i);
    while( !a.empty() )
    {
        os << a.top() << ' ';
        a.pop();
    }
    is.close();
    os.close();
    return 0;
}

void DF( int k )
{
    s[k] = true;
    for ( vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it )
        if ( s[*it] == false )
            DF(*it);
    a.push(k);
}