#include <fstream.h>
int main ()
{
	ifstream f ("sortaret.in");
	ofstream g ("sortaret.out");
	long a[100001],n,i,j,m,b[50001][2],c[100001],contor=0;
	f>>n>>m;
	for (i=1;i<=n;i++) a[i]=0;
	for (i=1;i<=m;i++)
	{
		f>>b[i][1]>>b[i][2];
		a[b[i][2]]++;
	}
	
	for (i=1;i<=n;i++)
	
		if (a[i]==0)
		{
			contor++;
			c[contor]=i;
			
			for (j=1;j<=n;j++) if (b[ j ][1]==i) a[b[ j ] [2] ] --;
			a[i]=100001;
		}	
	for (i=1;i<=n;i++) g<<c[i]<<" ";	
			
	return 0;
}