#include<bits/stdc++.h>
#define N 500009
#define M 1000009
using namespace std;
int n,m,hd[N],tot,hr[N],tr,dfn[N],ver[N],timer,fa[N],val[N],semi[N],idom[N],sz[N],anc[N];
struct edge{
	int t,nxt;
} es[M],er[M];
void add(int u,int v){es[++tot]=(edge){v,hd[u]},hd[u]=tot;}
void addr(int u,int v){er[++tr]=(edge){v,hr[u]},hr[u]=tr;}
vector<int> son[N];
void dfs(int u){
	ver[dfn[u]=++timer]=u;
	for(int i=hd[u];i;i=es[i].nxt){
		int v=es[i].t;
		if(!dfn[v])anc[v]=u,dfs(v);
	}
}
void build(){for(int i=1;i<=n;++i)fa[i]=i,val[i]=0;}
int cmp(int u,int v){return dfn[u]<dfn[v]?u:v;}
int find(int u){
	if(fa[u]==u)return u; 
	int f=find(fa[u]);
	if(dfn[semi[val[u]]]>dfn[semi[val[fa[u]]]])val[u]=val[fa[u]];
	return fa[u]=f;
}
void unite(int u){
	fa[u]=anc[u];val[u]=u;/////////
}
void dfs_dom(int u){
	sz[u]=1;
	for(int i=0;i<son[u].size();++i){
		int v=son[u][i];
		dfs_dom(v);
		sz[u]+=sz[v];
	}
}
void LT(){
	dfs(1);
	dfn[0]=n+1;
	build();
	for(int x=timer;x;--x){
		int v=ver[x];
		for(int i=hr[v];i;i=er[i].nxt){
			int u=er[i].t;
			if(dfn[u]<dfn[v])semi[v]=cmp(semi[v],u);
			else {
				find(u);
				semi[v]=cmp(semi[v],semi[val[u]]);
			}
		}
		for(int i=0;i<son[v].size();++i){
			int w=son[v][i];
			find(w);
			if(semi[val[w]]==v)idom[w]=v;
			else idom[w]=val[w];//////
		}
		unite(v);//////////////////
		son[semi[v]].push_back(v);
		son[v].clear();
	}
	//idom[1]=0;
	for(int x=2;x<=timer;++x){
		int u=ver[x];
		if(semi[u]!=idom[u])idom[u]=idom[idom[u]];
		son[idom[u]].push_back(u);
	}
	//for(int i=1;i<=n;++i)printf("%d ",idom[i]);puts("");
	dfs_dom(1);sz[1]=n;
	for(int i=1;i<=n;++i)printf("%d ",sz[i]);
}
int main(){
	// #ifndef ONLINE_JUDGE
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	// #endif
	cin>>n>>m;
	for(int i=1;i<=m;++i){
		int u,v;scanf("%d %d",&u,&v);
		add(u,v),addr(v,u);
	}
	LT();
	return 0;
}