#include<fstream.h>
#define N 50001
#define M 100001
long n,i,j,k,m,c[N]={0},*g[N],a[M],b[M],deg[N]={0},v[N],t=1;
int contine(long g[N],long n,long x)
{for(i=0;i<n;i++)
if(g[i]==x)
      return 1;
return 0;}
void explorare(long *k,long i)
{long j;
c[i]=1;
for(j=deg[i]-1;j>=0;j--)
if(c[g[i][j]]==0)
      explorare(k,g[i][j]);
v[(*k)++]=i;}
int main()
{ifstream f("sortaret.in");
ofstream h("sortaret.out");
f>>n>>m;
for(k=1;k<=m;k++)
      f>>a[k]>>b[k],deg[a[k]]++;
for(i=1;i<=n;deg[i++]=0)
      g[i]=(long*)malloc((deg[i]+1)*sizeof(long));
for(k=1;k<=m;k++)
if(contine(g[a[k]],deg[a[k]],b[k])==0)
      g[a[k]][deg[a[k]]++]=b[k];
for(i=1;i<=n;i++)
if(c[i]==0)
      explorare(&t,i);
for(j=n;j>=1;j--)
      h<<v[j]<<" ";
f.close();
h.close();
return 0;}