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

const int kMaxN = 100000 + 5;
const int kMaxM = 100000 + 5;

struct Edge {
	int from;
	int to;
	int nxt;
} e[kMaxM], e2[kMaxM];
int tot, head[kMaxN];
int tot2, head2[kMaxN];
void Add(int x, int y) {
	e[++tot] = (Edge){x, y, head[x]};
	head[x] = tot;
} 
void Add2(int x, int y) {
	e2[++tot2] = (Edge){x, y, head2[x]};
	head2[x] = tot2;
}

int n, m;
int dfn[kMaxN], low[kMaxN];
bool vis[kMaxN], vis2[kMaxN];
int col[kMaxN];
stack<int> S;
int ans[kMaxN];
int cnt;

void Tarjan(int x) {
	S.push(x);
	dfn[x] = low[x] = ++cnt;
	vis[x] = 1;
	for (int i = head[x]; i != 0; i = e[i].nxt) {
		int to = e[i].to;
		if (dfn[to] == 0) {
			Tarjan(to);
			low[x] = min(low[x], low[to]);
		}
		else if (vis[to] == 1) {
			low[x] = min(low[x], low[to]);
		}
	}
	if (dfn[x] == low[x]) {
		int now;
		while (now != x) {
			now = S.top();
			vis[now] = 0;
			col[now] = x;
			S.pop();
		}
	}
}

void Dfs(int x) {
	vis2[x] = 1;
	for (int i = head2[x]; i != 0; i = e2[i].nxt) {
		int to = e2[i].to;
		if (vis2[to] == 0) {
			Dfs(to);
			ans[x] = max(ans[to], ans[x]);
		}
	}
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= m; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		Add(x, y);
	}
	for (int i = 1; i <= n; i++) {
		if (dfn[i] == 0) {
			Tarjan(i); 
		}
	} 
	
	for (int i = 1; i <= n; i++) {
		for (int j = head[i]; j != 0; j = e[j].nxt) {
			int to = e[j].to;
			if (col[i] != col[to]) {
				Add2(col[i], col[to]);
			}
		}
	}	
	
	for (int i = 1; i <= n; i++) {
		ans[col[i]] = max(ans[col[i]], i);
	}
	for (int i = 1; i <= n; i++) {
		if (vis2[col[i]] == 0) {
			Dfs(col[i]);
		}
	}
	
	for (int i = 1; i <= n; i++) {
		cout << ans[col[i]] << " ";
	}
	cout << endl;
  return 0;
}

只过了第一个点