#include<bits/stdc++.h>
namespace rgs = std::ranges;
using std::cin, std::cout;
using ll = long long;
using u64 = unsigned long long;
using db = double;

const int N = 1000005;
int n, m;
std::vector<int> e[N], ee[N];
int in[N];
int vis[N], a[N], cc;
void dfs0(int x) {
	vis[x] = 1;
	for(int x : ee[x]) if(!vis[x]) {
		dfs0(x);
	}
	a[++cc] = x;
}
int ans[N];
int max[N];
int label[N];
std::bitset<128> reach[N];
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> m;
	for(int i = 0, u, v;i < m;++i) {
		cin >> u >> v;
		e[u].push_back(v);
		++ in[v];
	}
	std::queue<int> Q;
	std::vector<int> o;
	int cc = 0;
	for(int i = 1;i <= n;++i) {
		ee[i] = e[i];
		if(in[i] != (int) e[i].size()) {
			label[i] = ++cc;
			reach[i].set(cc);
		}
		if(in[i] == 0) Q.push(i);
	}
	for(int i = 1;i <= n;++i) if(!vis[i]) {
		dfs0(i);
	}
	for(;Q.size();) {
		int x = Q.front(); Q.pop();
		std::vector<int> list;
		for(int i = x;;) {
			list.push_back(i);
			if(e[i].empty()) break;
			int go = e[i].back();
			e[i].pop_back();
			i = go;
			if(--in[i] == 0) Q.push(i);
		}
		for(int i = list.size() - 1, cnt = 0;i >= 0;--i) {
			cnt += !label[list[i]];
			max[list[i]] = cnt;
		}
		for(int i = 1;i <= n;++i) {
			int x = a[i];
			for(int u : ee[x]) {
				max[x] = std::max(max[x], max[u]);
			}
			ans[x] += max[x];
		}
	}
	for(int i = 1;i <= n;++i) {
		int x = a[i];
		for(int u : ee[x]) {
			reach[x] |= reach[u];
		}
		ans[x] += reach[x].count();
	}
	for(int i = 1;i <= n;++i) {
		cout << ans[i] << " \n"[i == n];
	}
}