#define  _CRT_SECURE_NO_WARNINGS
#include <iostream>
using namespace std;
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>

vector<set<int>>tree;
vector<bool>node;
int max_num = 0;
void dfs(int n) {
	node[n] = 1;
	max_num = max(max_num, n);
	for (auto a : tree[n]) {
		if (!node[a])
			dfs(a);
	}
}
int main() {
	int n, m; cin >> n >> m;
	tree.resize(n + 1);
	for (int i = 0; i < m; i++) {
		int a, b;
		scanf("%d %d", &a, &b);
		tree[a].insert(b);
	}
	node.resize(n + 1);
	for (int i = 1; i <= n; i++) {
		node.clear();
		node.resize(n + 1);
		max_num = 0;
		node[i] = 1;
		dfs(i);
		cout << max_num << " ";
	}

	return 0;
}