#include <fstream.h>

struct nod { int x;
			nod *urm;};
nod *prim,*ultim,*p,*v[50001],*P;
int gri[50001],n,m,i,v1,v2;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int main(){
f>>n>>m;
for(i=1;i<=m;i++){f>>v1>>v2;
gri[v2]++;
p=new nod; p->x=v2; p->urm=v[v1];
v[v1]=p;}
for(i=1;i<=n;i++)
	if(gri[i]==0){
	p=new nod;
	p->urm=NULL;
	p->x=i;
	if(prim==NULL)
		prim = ultim =p;
	else {ultim->urm=p;
	ultim=p;}
	}
	while(prim){g<<prim->x<<' ';
	P=v[prim->x];
	while(P){gri[P->x]--;
	if(gri[P->x]==0){p=new nod;
	p->x=P->x; p->urm=NULL;
	ultim->urm=p;
	ultim=p;}
	P=P->urm;}
	prim=prim->urm;}
	f.close();g.close();
	return 0;}