68 74
7 8
24 23
55 56
3 50
61 62
12 1
32 33
36 35
9 8
44 50
53 5
29 28
16 2
36 37
3 22
44 45
27 28
66 65
34 4
31 32
64 65
13 12
10 9
67 66
5 47
55 54
6 51
20 21
67 4
17 29
41 40
48 49
19 20
18 17
35 4
25 24
33 34
38 37
5 48
43 30
63 62
60 61
66 6
26 27
64 63
14 13
67 68
68 54
42 41
52 53
39 38
50 49
59 58
46 45
39 40
57 58
1 11
52 51
15 2
57 56
2 67
23 3
26 25
6 53
30 31
10 11
7 14
1 30
22 21
42 43
47 46
16 15
59 60
18 19
 8 9
1 6
3 6
4 7
8 1
1 5
8 4
2 7
3 5
8 2
 7 7
7 6
7 2
6 1
5 4
5 1
1 4
3 7
 17 20
13 11
2 3
16 3
12 14
17 1
2 6
5 4
7 9
3 10
8 16
10 8
14 2
6 15
1 7
15 1
15 12
4 13
8 5
9 17
11 5
 6 6
4 3
4 2
5 4
6 5
4 6
1 6
 4 4
1 2
2 3
1 3
1 4
 10 11
9 3
8 7
1 2
1 8
10 8
7 10
4 1
6 4
3 6
5 9
2 5
 1 0
 9 9
9 8
7 6
8 7
5 6
3 2
1 5
1 3
1 4
4 2
 2 1
1 2
 16 20
1 16
15 14
5 11
12 1
16 2
5 14
2 4
6 1
11 7
11 1
8 12
9 6
7 5
10 15
1 8
14 10
4 13
3 9
13 16
6 3
 7 8
7 4
3 1
2 1
6 5
6 7
2 3
1 4
4 5
 9 9
1 9
6 7
8 7
1 8
5 7
3 2
4 9
8 3
6 1
 11 12
6 5
7 1
1 2
2 11
10 11
9 6
8 7
4 8
11 9
2 3
5 10
3 4
 5 4
1 2
3 4
1 4
5 1
 8 8
6 7
5 1
8 2
3 1
6 4
3 6
7 4
8 5
 10 10
2 5
7 8
1 7
1 9
5 3
6 9
5 9
6 4
1 10
8 9
 4 3
3 4
2 4
4 1
 13 15
9 1
12 3
6 11
8 2
2 5
13 10
3 4
8 4
11 9
9 2
10 8
1 6
7 12
5 13
4 7
 11 12
11 1
9 3
6 1
6 7
2 10
4 6
9 11
10 9
10 11
1 8
6 5
8 7
 8 8
1 6
7 3
1 8
7 8
5 4
4 1
6 5
6 2
 3 3
2 1
1 3
3 2
 17 21
8 2
9 6
6 7
3 14
12 16
4 11
11 15
14 13
13 4
5 8
6 1
2 5
16 7
7 12
3 17
14 8
17 10
7 14
1 9
15 14
10 3
 3 2
1 2
2 3
 3 3
3 2
1 3
1 2
 10 9
9 8
4 10
8 7
1 3
8 3
7 6
7 5
10 9
2 7
 11 12
10 1
8 7
4 11
5 2
7 9
6 10
11 6
2 8
1 4
9 3
9 4
3 5
 18 22
5 3
15 18
8 10
17 6
9 2
7 16
7 10
3 8
11 9
2 14
4 18
10 5
14 11
11 13
1 4
13 7
15 6
16 17
6 12
18 1
12 15
17 13
 5 5
5 1
2 3
4 2
5 2
1 4
 8 8
3 1
4 5
6 1
7 8
2 5
3 2
1 4
6 8

22
16
19
16
15
13
26
26
25
24
23
23
24
25
17
17
25
24
23
22
21
20
20
21
22
23
24
25
26
21
20
19
18
17
17
18
19
20
21
22
23
23
22
19
18
17
16
16
17
18
14
15
14
17
18
19
20
21
21
20
19
18
17
16
15
14
15
16
 3
4
5
4
4
4
5
3
 3
4
4
4
4
2
3
 9
6
6
10
9
7
10
8
11
7
10
8
11
7
8
7
10
 3
3
3
2
2
2
 1
2
2
2
 3
3
5
3
4
4
5
4
5
5
 0
 5
7
6
6
4
4
5
6
7
 1
1
 4
6
6
7
5
5
5
5
6
7
4
5
6
6
7
5
 3
4
4
2
3
4
3
 3
5
4
5
5
4
4
3
4
 4
3
4
5
6
6
5
6
5
5
4
 2
3
3
2
3
 3
6
4
6
4
5
6
5
 3
4
4
4
3
3
4
3
2
4
 2
2
2
1
 6
4
6
5
5
7
6
4
5
5
6
7
5
 3
5
5
5
5
4
5
4
4
4
3
 3
5
5
4
5
4
4
3
 1
1
1
 5
5
4
5
5
4
3
4
5
5
5
4
4
3
4
4
5
 2
1
2
 1
1
1
 5
5
4
5
5
5
4
3
3
4
 5
6
4
4
5
6
4
5
3
6
5
 9
8
9
9
8
6
6
8
7
7
6
7
5
7
7
5
5
8
 3
2
3
2
2
 3
5
4
4
5
3
5
4

#include<bits/stdc++.h>
#define ll long long
#define cri const register int
#define re register
using namespace std;
vector<int>To[500010];
vector<vector<int> >to[500010];
int dfn[500010],low[500010],sta[500010],num2,top;
int n,m,N;
const int inf=1e9;
void tarjan(cri x){
	dfn[x]=low[x]=++num2;
	sta[++top]=x;
	for(int y:To[x])
		if(!dfn[y]){
			tarjan(y);
			low[x]=min(low[x],low[y]);
			if(low[y]>=dfn[x]){
				int z;vector<int>tmp;
				do{ tmp.push_back(z=sta[top--]); }while(z!=y);
				to[x].push_back(tmp);
			}
		}
		else low[x]=min(low[x],dfn[y]);
}
inline int read(re int a=0,re char ch=getchar()){
	while(ch<'0'||ch>'9') ch=getchar();
	while(ch>='0'&&ch<='9') a=(a<<3)+(a<<1)+(ch^48),ch=getchar();
	return a;
}
int dp[2][500010],f[500010],g[500010],pre[500010],nxt[500010],mx[500010];
multiset<int>has[500010];
void dfs1(cri x){
	dp[0][x]=dp[1][x]=0;
	has[x].insert(0);
	for(vector<int>T:to[x]){
		for(int y:T) dfs1(y);
		if(T.size()==1) dp[0][x]=max(dp[0][x],f[T[0]]+1),has[x].insert(f[T[0]]+1);
		else{
			cri sz=T.size();
			pre[0]=nxt[sz+1]=0;
			for(int i=0;i<sz;i++) pre[i+1]=max(pre[i],f[T[i]]+1+i);
			//cout<<x<<endl;
			for(int i=sz;i;i--) nxt[i]=max(nxt[i+1],f[T[i-1]]+1+sz-i);
			int tmp=inf;
			for(int i=1;i<=sz+1;i++) tmp=min(tmp,max(pre[i-1],nxt[i]));//,cout<<pre[i-1]<<"---"<<nxt[i]<<"---"<<tmp<<endl;
			has[x].insert(dp[1][x]=tmp);
		}
	}
	//cout<<"x="<<x<<endl;
	//for(int y:has[x]) cout<<y<<" ";puts("");
	f[x]=max(dp[0][x],dp[1][x]);
}
int mn1[4000010],mn2[4000010],F[1000010],G[1000010];
void build(cri k,cri l,cri r){
	if(l==r) return mn1[k]=F[l],mn2[k]=G[l],void();
	cri mid=l+r>>1;
	build(k<<1,l,mid);build(k<<1|1,mid+1,r);
	mn1[k]=max(mn1[k<<1],mn1[k<<1|1]);
	mn2[k]=max(mn2[k<<1],mn2[k<<1|1]);
}
int get1(cri k,cri l,cri r,cri L,cri R){
	if(L>R) return 0;
	if(l>=L&&r<=R) return mn1[k];
	cri mid=l+r>>1;
	if(R<=mid) return get1(k<<1,l,mid,L,R);
	if(L>mid) return get1(k<<1|1,mid+1,r,L,R);
	return max(get1(k<<1,l,mid,L,mid),get1(k<<1|1,mid+1,r,mid+1,R));
}
int get2(cri k,cri l,cri r,cri L,cri R){
	if(L>R) return 0;
	if(l>=L&&r<=R) return mn2[k];//cout<<k<<" "<<l<<" "<<r<<" "<<L<<" "<<R<<endl;
	cri mid=l+r>>1;
	if(R<=mid) return get2(k<<1,l,mid,L,R);
	if(L>mid) return get2(k<<1|1,mid+1,r,L,R);
	return max(get2(k<<1,l,mid,L,mid),get2(k<<1|1,mid+1,r,mid+1,R));
}
void dfs2(cri x){//cout<<x<<endl;
	for(vector<int>T:to[x]){
		if(T.size()==1){
			has[x].erase(has[x].find(f[T[0]]+1));
			g[T[0]]=max(*has[x].rbegin(),g[x])+1;
			has[x].insert(f[T[0]]+1);
		}
		else{
			cri sz=T.size();
			pre[0]=nxt[sz+1]=0;
			for(int i=0;i<sz;i++) pre[i+1]=max(pre[i],f[T[i]]+1+i);
			for(int i=sz;i;i--) nxt[i]=max(nxt[i+1],f[T[i-1]]+1+sz-i);
			int tp=inf,is=0;
			for(int i=1;i<=sz+1;i++) if(max(pre[i-1],nxt[i])<tp) tp=max(pre[i-1],nxt[i]),is=i;
			set<pair<int,int>>q1,q2;
			has[x].erase(has[x].find(dp[1][x]));
			f[x]=max(*has[x].rbegin(),g[x]);
			has[x].insert(dp[1][x]);
			vector<int>tmp;
			tmp.push_back(x);
			for(int y:T) tmp.push_back(y);//,cout<<"? "<<y<<endl;
			for(int i=0;i<=sz;i++) F[i]=f[tmp[i]]+i,G[i]=f[tmp[i]]+sz-i+1,G[i+sz+1]=f[tmp[i]]-i,F[i+sz+1]=f[tmp[i]]+sz+1+i;
			build(1,0,sz+sz+1);
			for(int i=1;i<=sz;i++){
				if(is==i) is++;//cout<<is<<endl;
				while((is+1)%(sz+1)!=i&&max(get1(1,0,sz+sz+1,i+1,is)-i,get2(1,0,sz+sz+1,is+1,sz+i)+i)<
									   max(get1(1,0,sz+sz+1,i+1,is-1)-i,get2(1,0,sz+sz+1,is,sz+i)+i)) is++;
				//cout<<i<<" "<<tmp[i]<<" "<<is<<" "<<max(get1(1,0,sz+sz+1,i,is-1)-i,get2(1,0,sz+sz+1,is,sz+1+i)+i)<<" ";
				//cout<<max(get1(1,0,sz+sz+1,i,is-1)-i,get2(1,0,sz+sz+1,is,sz+1+i)+i)<<endl;
				g[tmp[i]]=max(get1(1,0,sz+sz+1,i+1,is-1)-i,get2(1,0,sz+sz+1,is,sz+i)+i);
			}
		}
		for(int y:T) dfs2(y);
	}
	f[x]=max(dp[0][x],dp[1][x]);
}
int main(){
	n=read(),m=read();N=n;
	for(int i=1;i<=m;i++){
		cri x=read(),y=read();
		To[x].push_back(y);
		To[y].push_back(x);
	}
	tarjan(1);dfs1(1);dfs2(1);
	for(int i=1;i<=n;i++) printf("%d ",max(f[i],g[i]));
}
/*
8 8
6 7
5 1
8 2
3 1
6 4
3 6
7 4
8 5

*/