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

const int N = 1e6 + 5;

vector <int> adj[N], edg[N];
int ans[N], vis[N];
int n, m;

queue <int> q;
int seq[N];
void solve(int s) {
	int len = 0;
	while (s) {
		seq[++len] = s;
		if (!edg[s].size()) break;
		int v = edg[s].back();
		edg[s].pop_back();
		s = v;
	}
	memset(vis, 0, sizeof(vis));
	int cnt = 0;
	for (int i = len; i >= 1; i--) {
		q.push(seq[i]); vis[seq[i]] = 1; ++cnt;
		while (!q.empty()) {
			int u = q.front(); q.pop();
			for (auto v : adj[u]) {
				if (!vis[v]) {
					vis[v] = 1; q.push(v); ++cnt;
				}
			}
		}
		ans[seq[i]] = cnt;
	}
}

int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		edg[u].push_back(v);
	}
	for (int i = 1; i <= n; i++) ans[i] = 1;
	for (int i = 1; i <= n; i++) {
		while (edg[i].size()) {
			solve(i);
		}
	}
	for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
	cout << '\n';
	return 0;
}