#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
int q[100009],i,j,sel[100009],vect[10009],n,m,s,x,y;
vector<int> G[100009];


void bfs(int pl)
{
  int p,u,x;
  vector<int> :: iterator it;
  sel[pl]=true;
  p=u=1;
  q[1]=pl;

  while(p<=u)
  {
     x=q[p];
     for(it=G[x].begin();it!=G[x].end();++it)
     if(!sel[*it])
     {
        q[++u]=*it;
        sel[*it]=true;

     }
    printf("%d ",x);
    ++p;
}
}


int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(i=1;i<=m;++i)
    {
       scanf("%d%d",&x,&y);
       G[x].push_back(y);

    }

    for(i=1;i<=n;++i)
    if(!sel[i])
    bfs(i);




    return 0;
}