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

void add(list &l,long x)
{nod *nou=new nod;
nou->info=x;
nou->next=l;
l=nou;}

int apartine(list l,long x)
{list d;
for(d=l;d!=NULL;d=d->next)
if(d->info==x)
         return 1;
return 0;}


long del(list &l)
{Nod *aux=l->next;
long x=l->info;
free(l);
l=aux;
return x;}

void explorare(long i)
{c[i]=1;
list s=NULL;
add(s,i);
while(s!=NULL)
        {j=del(s);
        c[j]=1;
        printf("%ld ",j);
        for(k=n;k>=1;k--)
        if(c[k]==0&&apartine(l[j],k)==1)
                {c[k]=1;
                add(s,k);}}}

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);}
for(i=1;i<=n;i++)
if(c[i]==0)
       explorare(i);
fclose(stdin);
fclose(stdout);
return 0;}