#include<stdio.h>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
queue <int> q;
vector <int> succ[50005];
int pred[50005];
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	int n,m,i,x,y,val,nr;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		pred[y]++;
		succ[x].push_back(y);
	}
	for(i=1;i<=n;i++)
		if(pred[i]==0)
				q.push(i);
	while(q.size()!=0)
	{
		val=q.front();
		printf("%d ",val);
		nr=succ[val].size();
		for(i=0;i<nr;i++)
		{
			--pred[succ[val][i]];
			if(pred[succ[val][i]]==0)
				q.push(succ[val][i]);
		}
		q.pop();
	}

	return 0;
}