#include<fstream.h>
#define max 50//001
struct graf
 {unsigned int nod;
  graf *urm;
 };
graf *g[max];
long grad[max],q[max];
void sterge(long x)
{graf *p=g[x];
while(p) {grad[p->nod]--;sterge(p->nod);p=p->urm;}
}
void adauga(long x,long y)
{graf *p;
p=new graf;
p->nod=y;
p->urm=g[x];
g[x]=p;
}
void creste(unsigned int y)
{graf *p;
p=g[y];
while(p) {grad[p->nod]=grad[y]+1;
	  creste(p->nod);
	  p=p->urm;}
}
int main()
{ifstream f("sortaret.in");
ofstream h("sortaret.out");
long n,x,y,p,u;
unsigned long m,i;
f>>n>>m;
for(i=1;i<=m;i++)
 {f>>x>>y;adauga(x,y);grad[y]=grad[x]+1;creste(y);}
f.close();
while(1)
{p=0;u=-1;
for(i=1;i<=n;i++) if(!grad[i])  {q[++u]=i;grad[i]=-1;}
if(p>u)  break;
 else
  for(i=0;i<=u;i++)
   {h<<q[i]<<' ';
    sterge(q[i]);
   }
}
h<<'\n';
h.close();
return 0;
}