60tps(re)

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int oo=1e9;
int n,m,dp[2100],ans;
vector<int>a[2100];
bool vis[2100];
int dfs(int u)
{
	if(vis[u])return dp[u];
	vis[u]=1;
	dp[u]=1;
	for(auto p:a[u])
	{
		dp[u]=max(dp[u],dfs(p)+1);
	}
	return dp[u];
}
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int u,v;
		cin>>u>>v;
		a[v].push_back(u);
	}
	for(int i=1;i<=n;i++)cout<<dfs(i)<<"\n";
	return 0;
}