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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

import static java.util.Collections.reverse;

/**
 * @author Don Li
 */
public class CactusToTree {
    
    int N = (int) 5e5 + 10;
    
    int n, m;
    int[][][] G;
    
    int timer = 0;
    int[] tin = new int[N], low = new int[N];
    boolean[] bridge = new boolean[N * 2];
    
    int nc = 0;
    boolean[] vis = new boolean[N];
    int[] vertex_to_cycle = new int[N];
    List<Integer>[] cycle = new List[N];
    
    int[] par = new int[N]; 
    int[] len = new int[N]; 
    int[] L = new int[N];   
    int[] Z = new int[N];  
    
    void solve() {
        n = in.nextInt(); m = in.nextInt();
        int[] fr = new int[m], to = new int[m], wt = new int[m];
        for (int i = 0; i < m; i++) {
            fr[i] = in.nextInt() - 1;
            to[i] = in.nextInt() - 1;
            wt[i] = i;
        }
        G = build_graph(n, fr, to, wt);
        
        mark_bridges(0, -1);
        
        for (int i = 0; i < n; i++) {
            if (!vis[i]) {
                cycle[nc] = new ArrayList<>();
                dfs(i, nc++);
            }
        }
        
        create_spanning_tree_and_init_l(0);
        
        solve_cycle(0, -1, 0);
        
        for (int i = 0; i < n; i++) {
            if (i > 0) out.print(' ');
            out.print(Math.max(L[i], Z[i]));
        }
    }
    
    void solve_cycle(int u, int p, int carry) {
        L[u] = Math.max(L[u], carry);
        
        int id = vertex_to_cycle[u]; int k = cycle[id].size();
        for (int it = 0; it < 2; it++) {
            PriorityQueue<int[]> qu = new PriorityQueue<>((a, b) -> {
                if (a[0] != b[0]) return -Integer.compare(a[0], b[0]);
                return -Integer.compare(a[1], b[1]);
            });
            for (int i = 0; i < 2 * k; i++) {
                int d = 2 * k - i;
                while (!qu.isEmpty() && qu.peek()[1] > d + k / 2) qu.poll();
                if (!qu.isEmpty()) Z[cycle[id].get(i % k)] = Math.max(Z[cycle[id].get(i % k)], qu.peek()[0] - d);
                qu.offer(new int[]{L[cycle[id].get(i % k)] + d, d});
            }
            reverse(cycle[id]);
        }
        
        for (int v : cycle[id]) {
            int fi = 0, se = 0;
            for (int[] t : G[v]) {
                int w = t[0], e = t[1];
                if (w != p && bridge[e]) {
                    if (fi < 1 + len[w]) {
                        se = fi;
                        fi = 1 + len[w];
                    } else if (se < 1 + len[w]) {
                        se = 1 + len[w];
                    }
                }
            }
            for (int[] t : G[v]) {
                int w = t[0], e = t[1];
                if (w != p && bridge[e]) {
                    int passValue = Math.max(carry, Z[v]);
                    if (1 + len[w] == fi) passValue = Math.max(passValue, se);
                    else passValue = Math.max(passValue, fi);
                    solve_cycle(w, v, passValue + 1);
                }
            }
        }
    }
    
    void create_spanning_tree_and_init_l(int s) {
        int[] qu = new int[n]; boolean[] inq = new boolean[n];
        int qh = 0, qt = 0;
        qu[qt++] = s;
        inq[s] = true;
        par[s] = -1;
        while (qh < qt) {
            int u = qu[qh++];
            for (int[] t : G[u]) {
                int v = t[0];
                if (!inq[v]) {
                    qu[qt++] = v;
                    inq[v] = true;
                    par[v] = u;
                }
            }
        }
        
        for (int i = n - 1; i >= 0; i--) {
            int u = qu[i];
            for (int[] t : G[u]) {
                int v = t[0], e = t[1];
                if (par[v] == u) {
                    len[u] = Math.max(len[u], len[v] + 1);
                    if (bridge[e]) L[u] = Math.max(L[u], len[v] + 1);
                }
            }
        }
    }
    
    void dfs(int u, int id) {
        vis[u] = true;
        vertex_to_cycle[u] = id;
        cycle[id].add(u);
        for (int[] t : G[u]) {
            int v = t[0], e = t[1];
            if (!bridge[e] && !vis[v]) {
                dfs(v, id);
            }
        }
    }
    
    void mark_bridges(int u, int p) {
        low[u] = tin[u] = ++timer;
        for (int[] t : G[u]) {
            int v = t[0], e = t[1];
            if (tin[v] == 0) {
                mark_bridges(v, u);
                low[u] = Math.min(low[u], low[v]);
                if (low[v] > tin[u]) bridge[e] = true;
            } else if (v != p) {
                low[u] = Math.min(low[u], tin[v]);
            }
        }
    }
    
    int[][][] build_graph(int n, int[] from, int[] to, int[] weight) {
        int[][][] G = new int[n][][];
        int[] cnt = new int[n];
        for (int i = 0; i < from.length; i++) {
            cnt[from[i]]++;
            cnt[to[i]]++;
        }
        for (int i = 0; i < n; i++) G[i] = new int[cnt[i]][];
        for (int i = 0; i < from.length; i++) {
            G[from[i]][--cnt[from[i]]] = new int[]{to[i], weight[i]};
            G[to[i]][--cnt[to[i]]] = new int[]{from[i], weight[i]};
        }
        return G;
    }
    
    public static void main(String[] args) {
        in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);
        new CactusToTree().solve();
        out.close();
    }
    
    static FastScanner in;
    static PrintWriter out;
    
    static class FastScanner {
        BufferedReader in;
        StringTokenizer st;
        
        public FastScanner(BufferedReader in) {
            this.in = in;
        }
        
        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        
        public int nextInt() {
            return Integer.parseInt(nextToken());
        }
        
        public long nextLong() {
            return Long.parseLong(nextToken());
        }
        
        public double nextDouble() {
            return Double.parseDouble(nextToken());
        }
    }
}
