#include<fstream.h>
#define N 50001
#define M 100001
long n,i,j,k,m,c[N],*g[N],a[M],b[M],w[N],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=w[i]-1;j>=0;j--)
if(!c[g[i][j]])
      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],w[a[k]]++;
for(i=1;i<=n;w[i++]=0)
      g[i]=(long*)malloc(w[i]*sizeof(long));
for(k=1;k<=m;k++)
if(!contine(g[a[k]],w[a[k]],b[k]))
      g[a[k]][w[a[k]]++]=b[k];
for(i=1;i<=n;i++)
if(!c[i])
      explorare(&t,i);
for(j=n;j>0;j--)
      h<<v[j]<<" ";
return 0;}