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 <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1000005;
const int maxe=2000005;
struct Stack
{
	int st[maxe],sttop;
	void push(int u){st[++sttop]=u;}
	bool empty(){return sttop==0;}
	int top(){return st[sttop];}
	int pop(){return sttop>0?st[sttop--]:0;}
};
struct MonoQueue
{
	int q[maxn],p[maxn],ql,qr;
	void init(){ql=1;qr=0;}
	void push(int u,int pos)
	{
		while (u>q[qr]&&ql<=qr)
			qr--;
		q[++qr]=u;
		p[qr]=pos;
	}
	int top(){return q[ql];}
	int pos(){return p[ql];}
	void valid(int pos)
	{
		while (ql<=qr&&p[ql]<pos)
			ql++;
	}
	bool empty(){return qr<ql;}
};
struct Circ_Sqr_Tree
{
	int h[maxn],to[maxe],nx[maxe],et;
	int nt;
	bool sqr[maxn];
	int deg[maxn];
	Circ_Sqr_Tree(){et=1;}
	void addedge(int u,int v)
	{
		et++;
		to[et]=v;
		nx[et]=h[u];
		h[u]=et;
		et++;
		to[et]=u;
		nx[et]=h[v];
		h[v]=et;
		deg[u]++;
		deg[v]++;
	}
	int f[maxn],g[maxn];
	int st[maxn*2];
	int sec[maxn],updfrom[maxn];
	MonoQueue Q;
	bool setsqr(int u){sqr[u]=1;}
	int dist(int x,int y,int len){return min(x-y,y-x+len);}
	void cycle(int u,int from)
	{
		int len=deg[u],idx=0;
		for (int i=h[u];i;i=nx[i])
		{
			idx++;
			if (to[i]!=from)
				if (f[to[i]]+dist(len,idx,len)>f[u])
					f[u]=f[to[i]]+dist(len,idx,len);
		}
		f[u]--;
	}
	void dfs(int u,int from)
	{
		for (int i=h[u];i;i=nx[i])
			if (to[i]!=from)
			{
				dfs(to[i],u);
				if (!sqr[u])
					if (f[to[i]]+1>f[u])
					{
						sec[u]=f[u];
						f[u]=f[to[i]]+1;
						updfrom[u]=to[i];
					}
					else
						if (f[to[i]]+1>sec[u])
							sec[u]=f[to[i]]+1;
			}
		if (sqr[u])
			cycle(u,from);
	}
	void cycle2(int u,int from)
	{
		int len=deg[u],idx=0;
		Q.init();
		for (int i=h[u];i;i=nx[i])
		{
			idx++;
			st[idx]=to[i];
			Q.valid(idx-len/2);
			if (to[i]!=from&&!Q.empty())
				if (Q.top()+idx>g[to[i]])
					g[to[i]]=Q.top()+idx;
			if (to[i]!=from)
				Q.push(f[to[i]]-idx,idx);
			else
				Q.push(g[to[i]]-idx,idx);
		}
		for (int i=h[u];i;i=nx[i])
		{
			idx++;
			st[idx]=to[i];
			Q.valid(idx-len/2);
			if (to[i]!=from&&!Q.empty())
				if (Q.top()+idx>g[to[i]])
					g[to[i]]=Q.top()+idx;
			if (to[i]!=from)
				Q.push(f[to[i]]-idx,idx);
			else
				Q.push(g[to[i]]-idx,idx);
		}
		Q.init();
		for (int i=idx;i;i--)
		{
			Q.valid(-i-len/2);
			if (st[i]!=from&&!Q.empty())
				if (Q.top()-i>g[st[i]])
					g[st[i]]=Q.top()-i;
			if (st[i]!=from)
				Q.push(f[st[i]]+i,-i);
			else
				Q.push(g[st[i]]+i,-i);
		}
	}
	void dfs2(int u,int from)
	{
		if (sqr[u])
			cycle2(u,from);
		for (int i=h[u];i;i=nx[i])
			if (to[i]!=from)
			{
				if (!sqr[u])
				{
					if (g[u]+1>g[to[i]])
						g[to[i]]=g[u]+1;
					if (to[i]!=updfrom[u])
					{
						if (f[u]+1>g[to[i]])
							g[to[i]]=f[u]+1;
					}
					else
						if (sec[u]+1>g[to[i]])
							g[to[i]]=sec[u]+1;
				}
				dfs2(to[i],u);
			}
		if (f[u]>g[u])
			g[u]=f[u];
	}
};
struct Cactus
{
	int h[maxn],to[maxe],nx[maxe],et;
	int nt;
	Cactus(){et=1;}
	void addedge(int u,int v)
	{
		et++;
		to[et]=v;
		nx[et]=h[u];
		h[u]=et;
		et++;
		to[et]=u;
		nx[et]=h[v];
		h[v]=et;
	}
	void input(int n,int m)
	{
		nt=n;
		int u,v;
		while (m--)
		{
			scanf("%d%d",&u,&v);
			addedge(u,v);
		}
	}
	int dfn[maxn],low[maxn],idx;
	bool vis[maxn];
	Stack E;
	void tarjan(int u,int from,Circ_Sqr_Tree &G)
	{
		dfn[u]=low[u]=++idx;
		vis[u]=1;
		for (int i=h[u];i;i=nx[i])
			if (i!=from&&i!=(from^1))
				if (!vis[to[i]])
				{
					E.push(i);
					tarjan(to[i],i,G);
					if (low[to[i]]>dfn[u])
					{
						G.addedge(u,to[i]);
						E.pop();
					}
					if (low[to[i]]==dfn[u])
					{
						nt++;
						G.setsqr(nt);
						while (E.top()!=i&&!E.empty())
							G.addedge(nt,to[E.pop()]);
						G.addedge(nt,to[E.pop()]);
					}
					if (low[to[i]]<low[u])
						low[u]=low[to[i]];
				}
				else
					if (dfn[to[i]]<low[u])
					{
						low[u]=dfn[to[i]];
						E.push(i);
					}
	}
};
Cactus C;
Circ_Sqr_Tree G;
int n,m;
int main()
{
	scanf("%d%d",&n,&m);
	C.input(n,m);
	C.tarjan(1,0,G);
	G.dfs(1,0);
	G.dfs2(1,0);
	for (int i=1;i<=n;i++)
		printf(i<n?"%d ":"%d\n",G.g[i]);
	return 0;
}