#include<stdio.h>
#define Nmx 50001

int n,m,post[Nmx],nr,viz[Nmx];

struct nod
{
    int x;
    nod *urm;
};

nod *G[Nmx];

void add(int x,int y)
{
    nod *aux=new nod;
    aux->urm=G[x];
    aux->x=y;
    G[x]=aux;
}

void citire()
{
    scanf("%d%d",&n,&m);
    int x,y;
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        add(x,y);
    }
}

void DFS(int k)
{
    viz[k]=1;
    for(nod *p=G[k];p;p=p->urm)
        if(!viz[p->x])
           DFS(p->x);
    post[++nr]=k;
}

void solve()
{
    for(int i=1;i<=n;++i)
        if(!viz[i])
         DFS(i);
    for(int i=n;i>=1;--i)
        printf("%d ",post[i]);
    printf("\n");
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    solve();
    return 0;
}