#include <cstdio>
#include <vector>

using namespace std;

FILE *f,*s;

int i,j,k,l,m,n;

int grad[100005],queue[100005];

vector <int> g[100005];

vector <int>:: iterator it;

int main()
{
	f=fopen("sortaret.in","r");
	s=fopen("sortaret.out","w");
	
	fscanf(f,"%d %d",&n,&m);
	
	for(i=1;i<=m;i++)
	{	
		fscanf(f,"%d %d",&j,&k);
		
		g[j].push_back(k);
		
		grad[k]++;
	}
	
	for(i=1;i<=n;i++)
	{
		if(grad[i]==0) queue[++queue[0]]=i;
	}	
	
	for(i=1;i<=n;i++)
	{
		l=queue[i];
		
		for(it=g[l].begin();it!=g[l].end();it++)
		{
			grad[*it]--;
			
			if(grad[*it]==0) queue[++queue[0]]=*it;
		}	
	}	
	
	for(i=1;i<=n;i++)
		fprintf(s,"%d ",queue[i]);
	
	fclose(s);
	
	return 0;
}