#include<stdio.h>
#define NR 50001
typedef struct Nod
{long info;
struct Nod *next;}nod,*list;
list l[NR],l1;
long n,i,j,k,m,c[NR]={0},v[NR];
        
void add(list &l,long x)
{nod *nou=new nod;
nou->info=x;
nou->next=l;
l=nou;}

void print(list l)
{list c;
for(c=l;c!=NULL;c=c->next)
       printf("%ld ",c->info);
printf("\n");}

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 explorare(long *k,long i)
{long j;
c[i]=1;
for(j=1;j<=n;j++)
if(c[j]==0&&apartine(l[i],j)==1)
        explorare(k,j);
add(l1,i);}

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);
       if(apartine(l[i],j)==0)
                 add(l[i],j);}
k=1;
for(i=1;i<=n;i++)
if(c[i]==0)
       explorare(&k,i);
print(l1);
fclose(stdin);
fclose(stdout);
return 0;}