#include<stdio.h>
#include <vector>
#include <queue>
using namespace std;

vector<long> dir[100001]; 
queue<long> q;
long nr,n,m,i,x,y,a[100001];
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%ld %ld",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%ld %ld",&x,&y);
		dir[x].push_back(y);
		a[y]++;
	}
	for(i=1;i<=n;i++)
		if(a[i]==0) q.push(i);
	
	while(!q.empty())
	{
		x=q.front();
		printf("%ld ",x);
		nr=dir[x].size();
		for (i=0;i<nr;i++) 
		{
			a[dir[x][i]]--;
			if(a[dir[x][i]]==0) q.push(dir[x][i]);
		}
		q.pop();
	}
	return 0;
}