#include<stdio.h>
#include<stdlib.h>
#define NR 50001
typedef struct Nod
{long info;
struct Nod *next;}nod,*list;
list l[NR];
long n,i,j,k,m,c[NR]={0},t=0,v[NR],f[NR]={0},x,y;

void merge(long f[NR],long v[NR],long p,long m,long q)
{long i=p,j=m+1,ny=p,y[NR],z[NR],k;
while(i<=m&&j<=q)
         {if(f[i]<=f[j])
                   {y[ny]=f[i];
                   z[ny]=v[i];
                   ny++;
                   i++;}
         else
                   {y[ny]=f[j];
                   z[ny]=v[j];
                   ny++;
                   j++;}}
while(i<=m)
         {y[ny]=f[i];
         z[ny]=v[i];
         ny++;
         i++;}
while(j<=q)
         {y[ny]=f[j];
         z[ny]=v[j];
         ny++;
         j++;}
for(k=p;k<=q;k++)
         {f[k]=y[k];
         v[k]=z[k];}}

void mergeSort(long f[NR],long v[NR],long p,long q)
{long m=(p+q)/2;
if(p<q)
         {mergeSort(f,v,p,m);
         mergeSort(f,v,m+1,q);
         merge(f,v,p,m,q);}}
         
int apartine(list l,long x)
{list c;
for(c=l;c!=NULL;c=c->next)
if(c->info==x)
        return 1;
return 0;}

void add(list &l,long x)
{nod *p,*nou=new nod;
nou->info=x;
nou->next=NULL;
if(l==NULL)
       {l=nou;
       return;}
p=l;
while(p->next!=NULL)
       p=p->next;
p->next=nou;}         

void explorare(long *t,long i)
{long j;
c[i]=1;
for(j=1;j<=n;j++)
if(c[j]==0&&apartine(l[i],j)==1)
        explorare(t,j);
f[i]=++(*t);}

int main()
{freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
scanf("%ld %ld",&n,&m);
for(k=1;k<=m;k++)
       {scanf("%ld %ld",&i,&j);
       add(l[i],j);}
for(i=1;i<=n;i++)
       v[i]=i;
for(i=1;i<=n;i++)
if(c[i]==0)
       explorare(&t,i);
mergeSort(f,v,1,n);
for(i=n;i>=1;i--)
       printf("%ld ",v[i]);
printf("\n");
fclose(stdin);
fclose(stdout);
return 0;}