#include <bits/stdc++.h>
#define N 1000011
using namespace std;
int n,m;
vector<int> G[N];
queue<int> q;int in[N],ord[N],clk,cur[N],col[N],k;
vector<vector<int> > v;
void dfs(int u,int c)
{//printf("dfs(%d,%d)\n",u,c);
	col[u]=c;v[c].push_back(u);
	if(cur[u]==G[u].size())return;
	dfs(G[u][cur[u]++],c);
}
int dep[N],suf[N],to[N],ans[N];
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;++i)
	{
		int u,v;scanf("%d%d",&u,&v);G[u].push_back(v);++in[v];
	}
	for(int i=1;i<=n;++i)
	{
		for(int _=0;_<(int)G[i].size()-in[i];++_)
		{
			v.push_back(vector<int>());
			dfs(i,k++);
		}
	}
	for(int i=1;i<=n;++i)if(!in[i])q.push(i);
	while(!q.empty())
	{
		int p=q.front();q.pop();
		ord[++clk]=p;
		for(int v:G[p])if(!--in[v])q.push(v);
	}
	for(int i=0;i<k;++i)
	{
		// printf("chain %d:",i);for(int x:v[i])printf("%d ",x);putchar(10);
		for(int i=1;i<=n;++i)dep[i]=v[i].size();
		for(int j=0;j<v[i].size();++j)dep[v[i][j]]=j;
		for(int j=v[i].size()-1;~j;--j)suf[j]=suf[j+1]+(col[v[i][j]]==i);
		for(int _=n;~_;--_)
		{
			int u=ord[_];
			for(int v:G[u])dep[u]=min(dep[u],dep[v]);
		}
		for(int i=1;i<=n;++i)ans[i]+=suf[dep[i]];
	}
	for(int i=1;i<=n;++i)printf("%d ",ans[i]);putchar(10);
	fclose(stdin);fclose(stdout);return 0;
}