#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	vector<vector<int>> adj(n);
	for (int i = 0; i < m; i++) {
		int u, v;
		cin >> u >> v;
		u--, v--;
		adj[u].push_back(v);
	}

	vector<vector<int>> paths;
	vector<vector<pair<int, int>>> path_pos(n);

	vector<vector<int>> adj2 = adj;
	for (int i = 0; i < n; i++) {
		while (!empty(adj2[i])) {
			vector<int> path;
			int u = i;
			path.push_back(u);
			path_pos[u].emplace_back(ssize(paths), 0);
			while (!empty(adj2[u])) {
				int v = adj2[u].back();
				adj2[u].pop_back();
				u = v;
				path_pos[u].emplace_back(ssize(paths), ssize(path));
				path.push_back(u);
			}
			paths.push_back(move(path));
		}
	}

	vector<vector<int>> counts(ssize(paths));
	vector<int> infinity(ssize(paths));
	for (int i = 0; i < ssize(paths); i++) {
		auto &p = paths[i];
		infinity[i] = ssize(p);
		auto &c = counts[i];
		c.resize(ssize(p) + 1);
		for (int j = ssize(p)-1; j >= 0; j--) {
			c[j] = c[j+1] + (path_pos[p[j]][0].first == i);
		}
	}

	vector<vector<int>> dp(n, infinity);

	for (int i = n-1; i >= 0; i--) {
		vector<int> &d = dp[i];
		for (auto [p,j]: path_pos[i]) d[p] = min(d[p], j);
		for (int v: adj[i]) {
			for (int j = 0; j < ssize(paths); j++) d[j] = min(d[j], dp[v][j]);
		}
	}

	for (int i = 0; i < n; i++) {
		int r = 0;
		for (int p = 0; p < ssize(paths); p++) r += counts[p][dp[i][p]];
		if (r == 0) r = 1;
		cout << r << " ";
	}
	cout << "\n";
}