#include <cstdio>
#include <vector>
# include <iostream>
using namespace std;
vector <int> G[100005];
bool sel[100005];
int x,y,i,j,n,m,nr,sol[100005];
void dfs(int x)
{
sel[x]=1;
for(int i=0;i<G[x].size();++i)
{
  if(!sel[G[x][i]]) dfs(G[x][i]);

}
sol[++nr]=x;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
   scanf("%d %d",&n,&m);
   for(int i=1;i<=m;++i)
   {
      scanf("%d %d",&x,&y);
      G[x].push_back(y);
      sel[i]=0;
   }
   for(int i=1;i<=n;++i)
   {
       if(!sel[i])
       {

           dfs(i);
       }
   }
  for(i=nr;i>=1;--i)
  {
      printf("%d ",sol[i]);
  }
    return 0;
}