#include <stdio.h>
#include <vector>

using namespace std;

vector<int> g[50005];
int n,m;

int q[50005];
int deg[50005];
int qp = 1;

void topologic(){
	for (int i = 1 ; i <= n ; ++i){
		if (deg[i] == 0){
			q[qp++] = i;
	}

	for (int i = i ; i <= n ; ++i){
		for (int j = 0 ; j < g[q[i]].size();++j){
			if (--deg[q[i]] == 0){
				q[qp++] = q[i];
			}
		}
		printf("%d ",q[i]);
	}
}

int main()
{
	freopen("sortare.in","r",stdin);
	freopen("sortare.out","w",stdout);

	scanf("%d%d",&n,&m);

	for (int i = 0 ; i < m ; ++i){
		int x,y;
		scanf("%d%d",&x,&y);
		g[x].push_back(y);
		deg[y]++;
	}
	return 0;
}