#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
struct nr{
int nre,val;
};
bool sor(nr a,nr b)
{
    return a.nre<b.nre;
}
nr f[100005];
int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++)
    {
        int x,y;
        cin>>x>>y;
        f[y].nre=max(f[x].nre+1,f[y].nre);


    }
    for(int i=1;i<=n;i++)
        f[i].val=i;
    sort(f+1,f+n+1,sor);

    for(int i=1;i<=n;i++)
        cout<<f[i].val<<" ";
    return 0;
}