#include<cstdio>
#include<queue>

using namespace std;

int n, m;
queue <int> L, S, graf[50001];
int grad[50001];

void Sortare() {
	int i, k, p;
	unsigned int j;
	
	for(i = 0; i <= n; i++)
		if(grad[i] == 0) S.push(i);
	/*
	while(S.size() > 0) {
		k = S.pop();
		L.push(k);
		
		while(graf[k].size() > 0) {
			p = graf[k].pop();
			graf[p]--;
			if(grad[p] != 0) S.push(p);
		}
	}
	*/
	
	while(L.size() > 0) printf("%d ", L.pop());
}

int main() {
	
	int i, x, y;
	
	freopen("sortaret.in", "r", stdin), freopen("sortaret.out", "w", stdout);
	scanf("%d %d", &n, &m);
	for(i = 1; i <= m; i++)
	{
		scanf("%d %d", &x, &y);
		graf[x].push(y);
		grad[y]++;
	}
	
	return 0;
}