///Kahn
#include <bits/stdc++.h>
using namespace std;
vector <int> v[50005];
queue <int> Q;
int grade[50005], sol[50005], x, y, ct, n, m, i;
int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f >> n >> m;
    for(i = 1; i <= m; i++)
    {
        f >> x >> y;
        v[x].push_back(y);
        grade[y]++;
    }
    for(i = 1; i <= n; i++)
        if(grade[i] == 0) Q.push(i);
    while(!Q.empty())
    {
        x = Q.front();
        Q.pop();
        sol[++ ct] = x;
        for(i = 0; i < v[x].size(); i++)
        {
            y = v[x][i];
            grade[y]--;
            if(grade[y] == 0) Q.push(y);
        }
    }
    for(i = 1; i <= n; i++)
        g << sol[i] << " ";
    return 0;
}