#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> a[50001];
int p,u,viz[50001],q[5001],nre[50001],n,m,x,y;
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++){
        f>>x>>y;
        a[x].push_back(y);
        ++nre[x];//nr de el care adacuga x in graf
        if(x!=y)
            ++viz[y];//viz[x]=nr de noduri care il introduc in lista
    }
    //add nodurile care initial sunt varfuri
     p=1;
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            q[++u]=i;
    while(p<=u){
        for(int i=0;i<nre[q[p]];i++){
            if(viz[a[q[p]][i]]==1){
                q[++u]=a[q[p]][i];
            }

            if(viz[a[q[p]][i]]!=0)
                --viz[a[q[p]][i]];
        }
        ++p;
    }
    for(int i=1;i<=n;i++)
        g<<q[i]<<' ';
    return 0;
}