#include <iostream>
#include <cstdio>

using namespace std;

struct nod
{
    int inf;
    nod* a;
}*p[50010];

int n,m,a[50001],x,y;

int b[50001];
void af(int i)
{
    int k=0;
    for(nod*c=p[i]; c!=NULL; c=c->a)
    {
        if(a[c->inf]!=3)
        {
            a[c->inf]=3;
            printf("%d ",c->inf);
            af(c->inf);
        }
    }
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1; i<=m; i++)
    {
        scanf("%d %d",&x,&y);
        nod*c=new nod;
        c->inf=y;
        c->a=p[x];
        p[x]=c;
        a[y]=1;
    }
    int k=0;
    for(int i=1; i<=n; i++)
        if(a[i]==0)
        {
            a[i]=3;
            printf("%d ",i);
            b[k++]=i;
        }
    for(int i=0; i<k; i++)
        af(b[i]);
    return 0;
}