#include<stdio.h>
#define max 50000
long b[max], v[max], n, m, i, x, y;
struct elem
{	long inf;
	elem *urm;
}	*a[max], *q;
FILE *f, *g;

int verif()
{	for(; i<=n; i++)
	{	if(b[i]==0 && v[i]==0)
			return 1;
	}
	return 0;
}

int main()
{       f=fopen("sortaret.in", "r");
	g=fopen("sortaret.out", "w");
	fscanf(f, "%ld%ld", &n, &m);
	for(i=0; i<m; i++)
	{       fscanf(f, "%ld%ld", &x, &y);
		b[y]++;
		q=new elem;
		q->inf=y;
		q->urm=a[x];
		a[x]=q;
	}
	i=1;
	while(verif()!=0)
	{       fprintf(g, "%ld ", i);
		v[i]=1;
		q=a[i];
		while(q)
		{       b[q->inf]--;
			q=q->urm;
		}
	}
	fprintf(g, "\n");
	fclose(g );
	return 0;
}