#include <stdio.h>

#define NMAX 50001
#define INPUT  "sortaret.in"
#define OUTPUT "sortaret.out"

int i,j,n,m,*G[NMAX],Gr[NMAX],St[NMAX],Mark[NMAX];

void DFS(int nod)
{
 int i;
 Mark[nod]=1;

 for (i=1;i<=G[nod][0];i++)
    if (!Mark[G[nod][i]])
      DFS(G[nod][i]);

 St[++St[0]]=nod;
}

int main()
{
 freopen(INPUT,"r",stdin);
 freopen(OUTPUT,"w",stdout);

 scanf("%d%d",&n,&m);
 for (i=1;i<=m;i++)
    {
     int x,y;
     scanf("%d%d",&x,&y);
     Gr[x]++;
    }

 fseek(stdin,0,SEEK_SET);

 scanf("%d%d",&n,&m);
 for (i=1;i<=m;i++)
    {
     int x,y;
     scanf("%d%d",&x,&y);
     G[x][++G[x][0]]=y;
    }

 DFS(1);

 for (i=St[0];i>=1;i--)
    printf("%d ",St[i]);

 fclose(stdin);
 fclose(stdout);
 return 0;
}