#include <fstream>
#include <vector>
#include <stack>
#define INF 0x3f3f3f3f
using namespace std;

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

using VI = vector<int>;
using VVI = vector<VI>;

int n, m;
VI ok;
VVI g;
stack<int> s;

void DF(int nod);

int main()
{
    is >> n >> m;
    int x, y;
    g = VVI(n + 1);
    ok = VI(n + 1);
    while ( m-- )
    {
        is >> x >> y;
        g[x].push_back(y);
    }
    for ( int i = 1; i <= n; ++i )
        if ( !ok[i] )
            DF(i);
    while ( s.size() )
    {
        os << s.top() << " ";
        s.pop();
    }
    is.close();
    os.close();
    return 0;
}

void DF(int nod)
{
    ok[nod] = 1;
    for ( const auto &nodv : g[nod] )
        if ( !ok[nodv] )
            DF(nodv);
    s.push(nod);
}