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>
using namespace std;
int e[2][2501000];
vector<int> adj[501000];
int n, m, pa[501000];
bool vis[501000];
vector<int> cir[501000];
int at[501000], num_cir, pos[501000], cnt_list, list[501000];
int dist[501000], ans[501000], dist_cir[501000], mv[2501000];
int queue[501000], head, tail;
void dfs(int id) {
  vis[id] = true;
  int i, j, s, p, q, ip;
  pos[id] = cnt_list++;
  for (i = 0; i < adj[id].size(); i++) {
    ip = adj[id][i];
    if (!vis[ip]) {
      pa[ip] = id;
      dfs(ip);
    }
  }
}
void tdfs(int id, int pr) {
  int i, j, s, p, q, ip, ie;
  dist[id] = 0;
  if (at[id] >= 0 && at[id] + n != pr) {
    ip = at[id];
    for (i = 1; i < cir[ip].size(); i++) {
      ie = cir[ip][i];
      tdfs(ie, at[id] + n);
      if (dist[id] < dist[ie] + min(i, (int)cir[ip].size() - i))
        dist[id] = dist[ie] + min(i, (int)cir[ip].size() - i);
    }
    dist_cir[id] = dist[id];
  }
  for (i = 0; i < adj[id].size(); i++) {
    ip = adj[id][i];
    if (ip != pr && !(at[id] >= 0 && at[ip] == at[id])) {
      tdfs(ip, id);
      if (dist[id] < dist[ip] + 1) dist[id] = dist[ip] + 1;
    }
  }
}
void solve(int id, int pr, int max_dist) {
  int i, j, s, p, q, ip, ie;
  vector<int> ma[2];
  ma[0].resize(adj[id].size() + 2);
  ma[1].resize(adj[id].size() + 2);
  ma[0][0] = 0;
  ans[id] = max(max_dist, dist[id]);
  for (i = 0; i < adj[id].size(); i++) {
    ip = adj[id][i];
    ma[0][i + 1] = ma[0][i];
    if (at[id] >= 0 && at[ip] == at[id]) continue;
    if (ip == pr)
      ma[0][i + 1] = max(ma[0][i + 1], max_dist);
    else
      ma[0][i + 1] = max(ma[0][i + 1], dist[ip] + 1);
  }
  if (at[id] >= 0) {
    if (at[id] + n == pr) {
      ma[0][i + 1] = max(ma[0][i], max_dist);
      ma[1][i] = max_dist;
    } else {
      ma[0][i + 1] = max(ma[0][i], dist_cir[id]);
      ma[1][i] = dist_cir[id];
    }
  } else
    ma[1][i] = 0;
  for (i = adj[id].size() - 1; i >= 0; i--) {
    ip = adj[id][i];
    ma[1][i] = ma[1][i + 1];
    if (at[id] >= 0 && at[ip] == at[id]) continue;
    if (ip == pr)
      ma[1][i] = max(ma[1][i], max_dist);
    else
      ma[1][i] = max(ma[1][i], dist[ip] + 1);
  }
  for (i = 0; i < adj[id].size(); i++) {
    ip = adj[id][i];
    if (ip == pr || (at[id] >= 0 && at[ip] == at[id])) continue;
    solve(ip, id, ma[0][i] + ma[1][i + 1] + 1);
  }
  if (at[id] >= 0 && at[id] + n != pr) {
    vector<int> bv;
    bv.resize(cir[at[id]].size() + 5);
    int mp = ma[0][i];
    head = tail = 0;
    ip = at[id];
    int k = (cir[ip].size()) / 2;
    for (i = 0; i < cir[ip].size() + k; i++) {
      ie = cir[ip][i % cir[ip].size()];
      if (i % cir[ip].size() == 0)
        mv[i] = max_dist - i;
      else
        mv[i] = dist[ie] - i;
      bv[i % cir[ip].size()] = max(bv[i % cir[ip].size()], mp);
      while (head < tail) {
        if (i - queue[head] > k)
          head++;
        else
          break;
      }
      bv[i % cir[ip].size()] = max(bv[i % cir[ip].size()], mv[queue[head]] + i);
      while (head < tail) {
        if (mv[queue[tail - 1]] <= mv[i])
          tail--;
        else
          break;
      }
      queue[tail++] = i;
    }
    head = tail = 0;
    for (i = cir[ip].size() + k; i >= 0; i--) {
      ie = cir[ip][i % cir[ip].size()];
      if (i % cir[ip].size() == 0)
        mv[i] = max_dist + i;
      else
        mv[i] = dist[ie] + i;
      while (head < tail) {
        if (queue[head] - i > k)
          head++;
        else
          break;
      }
      bv[i % cir[ip].size()] = max(bv[i % cir[ip].size()], mv[queue[head]] - i);
      while (head < tail) {
        if (mv[queue[tail - 1]] <= mv[i])
          tail--;
        else
          break;
      }
      queue[tail++] = i;
    }
    for (i = 0; i < cir[ip].size(); i++) {
      ie = cir[ip][i];
      if (i == 0) continue;
      solve(ie, at[id] + n, bv[i]);
    }
  }
}
int main() {
  int i, j, s, p, q, u, v;
  scanf("%d%d", &n, &m);
  for (i = 0; i < n; i++) adj[i].clear();
  for (i = 0; i < m; i++) {
    scanf("%d%d", &u, &v);
    u--;
    v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
    e[0][i] = u;
    e[1][i] = v;
  }
  memset(vis, false, sizeof(vis));
  cnt_list = 0;
  dfs(0);
  num_cir = 0;
  memset(at, -1, sizeof(at));
  for (i = 0; i < m; i++) {
    u = e[0][i];
    v = e[1][i];
    if (pos[u] > pos[v]) swap(u, v);
    if (u == pa[v]) continue;
    cnt_list = 0;
    while (true) {
      list[cnt_list++] = v;
      if (v == u) break;
      v = pa[v];
    }
    cir[num_cir].clear();
    for (j = cnt_list - 1; j >= 0; j--) {
      cir[num_cir].push_back(list[j]);
      at[list[j]] = num_cir;
    }
    num_cir++;
  }
  tdfs(0, -1);
  solve(0, -1, 0);
  for (i = 0; i < n; i++) {
    if (i) putchar(' ');
    printf("%d", ans[i]);
  }
  printf("\n");
  return 0;
}
