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;
long long read() {
  long long f = 1, x = 0;
  char s = getchar();
  while (s < '0' || s > '9') {
    if (s == '-') f = -f;
    s = getchar();
  }
  while (s >= '0' && s <= '9') {
    x = x * 10 + (s - '0');
    s = getchar();
  }
  return f * x;
}
int n, m, i, j, s, o, k;
vector<int> g[500005];
int cnt;
vector<int> bu[500005];
int bl[500005], rk[500005];
int vv[500005];
int d[500005], dpd[500005];
void dfs0(int x, int ff) {
  d[x] = d[ff] + 1;
  dpd[x] = 0x3f3f3f3f;
  for (int i = 0; i < (int)g[x].size(); i++) {
    int y = g[x][i];
    if (y != ff) {
      if (!d[y]) {
        dfs0(y, x);
        dpd[x] = min(dpd[x], dpd[y]);
      } else {
        dpd[x] = min(dpd[x], d[y]);
      }
    }
  }
  if (dpd[x] > d[x])
    vv[x] = -1;
  else
    vv[x] = 1;
  return;
}
void dfs00(int x, int ff) {
  if (dpd[x] == d[x]) {
    bu[++cnt].push_back(x);
    rk[x] = 0;
    bl[x] = cnt;
  } else if (dpd[x] < d[x]) {
    bl[x] = bl[ff];
    bu[bl[x]].push_back(x);
    rk[x] = (int)bu[bl[x]].size() - 1;
  }
  for (int i = 0; i < (int)g[x].size(); i++) {
    int y = g[x][i];
    if (y != ff && d[y] == d[x] + 1) {
      dfs00(y, x);
    }
  }
  return;
}
int dp1[500005], dp2[500005], dp0[500005];
vector<int> sm[500005];
void dfs(int x, int ff, int op) {
  if (!op) {
    dp1[x] = 0;
    int nw = 0;
    for (int i = 0; i < (int)g[x].size(); i++) {
      int y = g[x][i];
      sm[x].push_back(nw);
      if (y != ff) {
        dfs(y, x, vv[y] == 1 ? 1 : 0);
        dp1[x] = max(dp1[x], dp1[y] + 1);
        nw = max(nw, dp1[y] + 1);
      }
    }
    return;
  }
  int id = bl[x], le = (int)bu[id].size();
  int md = rk[x], ll = (md + le - (le / 2)) % le;
  for (int ii = 0; ii < le; ii++) {
    int t = bu[id][ii], nw = 0;
    for (int i = 0; i < (int)g[t].size(); i++) {
      int y = g[t][i];
      sm[t].push_back(nw);
      if (y != ff && bl[y] != id) {
        dfs(y, t, vv[y] == 1 ? 1 : 0);
        dp0[t] = max(dp0[t], dp1[y] + 1);
        nw = max(nw, dp1[y] + 1);
      }
    }
    dp1[t] = dp0[t];
  }
  for (int ii = (ll + 1) % le; ii != (md + 1) % le; ii = (ii + 1) % le) {
    int pr = bu[id][(ii + le - 1) % le], t = bu[id][ii];
    dp1[t] = max(dp1[t], dp1[pr] + 1);
  }
  for (int ii = (ll + le - 1) % le; ii != (md + le - 1) % le;
       ii = (ii + le - 1) % le) {
    int pr = bu[id][(ii + 1) % le], t = bu[id][ii];
    if (ii != (ll + le - 1) % le) {
      dp1[t] = max(dp1[t], dp1[pr] + 1);
    }
  }
  return;
}
int as[500005];
int q[500005], hd, tl;
int ds(int x, int y, int le) { return (y + le - x) % le; }
void dfs2(int x, int ff, int op, int fdp) {
  if (!op) {
    dp2[x] = fdp + 1;
    as[x] = max(dp2[x], dp1[x]);
    int nw = 0;
    for (int i = (int)g[x].size() - 1; i >= 0; i--) {
      int y = g[x][i];
      if (y != ff) {
        dfs2(y, x, vv[y] == 1 ? 1 : 0, max(dp2[x], max(sm[x][i], nw)));
        nw = max(nw, dp1[y] + 1);
      }
    }
    return;
  }
  dp0[x] = max(dp0[x], fdp + 1);
  int id = bl[x], le = (int)bu[id].size();
  hd = 1;
  tl = 0;
  int ll2 = (le - (le / 2)) % le;
  for (int i = ll2; i != 0; i = (i + 1) % le) {
    int t = bu[id][i];
    while (tl >= hd && dp0[bu[id][q[tl]]] + ds(q[tl], i, le) < dp0[t]) tl--;
    q[++tl] = i;
  }
  for (int i = 0; i < le; i++, ll2 = (ll2 + 1) % le) {
    int t = bu[id][i];
    if (tl >= hd) dp2[t] = max(dp2[t], dp0[bu[id][q[hd]]] + ds(q[hd], i, le));
    while (tl >= hd && dp0[bu[id][q[tl]]] + ds(q[tl], i, le) < dp0[t]) tl--;
    q[++tl] = i;
    if (tl >= hd && q[hd] == ll2) hd++;
  }
  ll2 = (le - 1 + le / 2) % le;
  hd = 1;
  tl = 0;
  for (int i = ll2; i != le - 1; i = (i + le - 1) % le) {
    int t = bu[id][i];
    while (tl >= hd && dp0[bu[id][q[tl]]] + ds(i, q[tl], le) < dp0[t]) tl--;
    q[++tl] = i;
  }
  for (int i = le - 1; i >= 0; i--, ll2 = (ll2 + le - 1) % le) {
    int t = bu[id][i];
    if (tl >= hd) dp2[t] = max(dp2[t], dp0[bu[id][q[hd]]] + ds(i, q[hd], le));
    while (tl >= hd && dp0[bu[id][q[tl]]] + ds(i, q[tl], le) < dp0[t]) tl--;
    q[++tl] = i;
    if (tl >= hd && q[hd] == ll2) hd++;
  }
  for (int ii = 0; ii < le; ii++) {
    int t = bu[id][ii], nw = 0;
    as[t] = max(dp2[t], dp0[t]);
    for (int i = (int)g[t].size() - 1; i >= 0; i--) {
      int y = g[t][i], dpp = dp2[t];
      if (t == x) dpp = max(dpp, fdp + 1);
      if (y != ff && bl[y] != id) {
        dfs2(y, t, vv[y] == 1 ? 1 : 0, max(dpp, max(nw, sm[t][i])));
        nw = max(nw, dp1[y] + 1);
      }
    }
  }
  return;
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= m; i++) {
    s = read();
    o = read();
    g[s].push_back(o);
    g[o].push_back(s);
  }
  dfs0(1, 0);
  cnt = 0;
  dfs00(1, 0);
  dfs(1, 0, vv[1] == 1 ? 1 : 0);
  dfs2(1, 0, vv[1] == 1 ? 1 : 0, -1);
  for (int i = 1; i <= n; i++) {
    printf("%d ", as[i]);
  }
  putchar('\n');
  return 0;
}
