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;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
struct edge {
  int v, next;
} vs[500010 << 1];
int n, m, ee, st[500010], vis[500010], id[500010];
int cnt, fa[500010], Ans[500010], w[500010];
int f1[500010], f2[500010], p1[500010], p2[500010];
vector<int> V[500010];
struct segment_tree {
  int a[500010], len, tree[500010 << 2];
  inline void build(int l, int r, int rt) {
    if (l == r) {
      tree[rt] = a[l];
      return;
    }
    int mid = (l + r) >> 1;
    build(l, mid, rt << 1);
    build(mid + 1, r, rt << 1 | 1);
    tree[rt] = max(tree[rt << 1], tree[rt << 1 | 1]);
  }
  inline int Ask(int L, int R, int l, int r, int rt) {
    if (L <= l && r <= R) return tree[rt];
    int mid = (l + r) >> 1, res = 0;
    if (mid >= L) res = max(res, Ask(L, R, l, mid, rt << 1));
    if (mid < R) res = max(res, Ask(L, R, mid + 1, r, rt << 1 | 1));
    return res;
  }
} S1, S2;
inline void addedge(int u, int v) {
  vs[++ee].v = v;
  vs[ee].next = st[u];
  st[u] = ee;
}
void print(vector<int> v) {
  for (int i = 0; i < v.size(); i++) printf("%d ", v[i]);
  puts("");
}
inline void dfs(int rt, int pr) {
  vis[rt] = 1;
  for (int i = st[rt]; i; i = vs[i].next) {
    if (vs[i].v == pr) continue;
    if (vis[vs[i].v]) {
      if (id[vs[i].v]) continue;
      id[vs[i].v] = ++cnt;
      int lx = rt;
      while (lx != vs[i].v) V[cnt].push_back(lx), id[lx] = cnt, lx = fa[lx];
      V[cnt].push_back(vs[i].v);
      reverse(V[cnt].begin(), V[cnt].end());
      continue;
    }
    fa[vs[i].v] = rt;
    dfs(vs[i].v, rt);
  }
}
inline void DFS(int rt, int pr) {
  p1[rt] = p2[rt] = -1;
  int G = 0, T = 0;
  for (int i = 1; i < (int)V[id[rt]].size(); i++) {
    int v = V[id[rt]][i], len = min((int)V[id[rt]].size() - i, i);
    for (int j = st[v]; j; j = vs[j].next) {
      if (id[vs[j].v] == id[rt]) continue;
      DFS(vs[j].v, v);
      int S = f1[vs[j].v] + 1, P = vs[j].v;
      if (S > f1[v]) swap(S, f1[v]), swap(P, p1[v]);
      if (S > f2[v]) swap(S, f2[v]), swap(P, p2[v]);
    }
    int S = f1[v] + len, P = v;
    if (S > G) G = S, T = P;
  }
  if (G > f1[rt]) swap(G, f1[rt]), swap(T, p1[rt]);
  if (G > f2[rt]) swap(G, f2[rt]), swap(T, p2[rt]);
  for (int i = st[rt]; i; i = vs[i].next) {
    if (id[vs[i].v] == id[rt]) continue;
    if (vs[i].v == pr) continue;
    DFS(vs[i].v, rt);
    int S = f1[vs[i].v] + 1, P = vs[i].v;
    if (S > f1[rt]) swap(S, f1[rt]), swap(P, p1[rt]);
    if (S > f2[rt]) swap(S, f2[rt]), swap(P, p2[rt]);
  }
}
inline int calc1(int s, int x, int y) {
  if (x <= y)
    return S1.Ask(x, y, 1, S1.len, 1) - s % S1.len;
  else
    return max(S1.Ask(x, S1.len, 1, S1.len, 1) - s,
               S1.Ask(1, y, 1, S1.len, 1) + S1.len - s);
}
inline int calc2(int s, int x, int y) {
  if (x >= y)
    return S2.Ask(y, x, 1, S2.len, 1) - (S2.len - s + 1) % S2.len;
  else
    return max(S2.Ask(1, x, 1, S2.len, 1) - S2.len - s + 1,
               S2.Ask(y, S2.len, 1, S2.len, 1) + s - 1);
}
inline void SDFS(int rt, int pr, int prs) {
  for (int i = st[rt]; i; i = vs[i].next) {
    if (vs[i].v == pr) continue;
    if (id[vs[i].v] == id[rt]) continue;
    SDFS(vs[i].v, rt, max((p1[rt] == vs[i].v ? f2[rt] : f1[rt]), prs) + 1);
  }
  if (!id[rt]) {
    Ans[rt] = max(prs, f1[rt]);
  } else {
    w[1] = max((id[p1[rt]] == id[rt] ? f2[rt] : f1[rt]), prs);
    int len = V[id[rt]].size();
    for (int i = 1; i < len; i++) w[i + 1] = f1[V[id[rt]][i]];
    S1.len = S2.len = len;
    for (int i = 1; i <= len; i++) S1.a[i] = i + w[i];
    for (int i = 1; i <= len; i++) S2.a[len - i + 1] = i + w[len - i + 1];
    S1.build(1, len, 1);
    S2.build(1, len, 1);
    for (int i = 1; i <= len; i++) {
      int p = i + (len / 2);
      Ans[V[id[rt]][i - 1]] = max(
          calc1(i,
                (i + 1 < 1 ? i + 1 + len : (i + 1 > len ? i + 1 - len : i + 1)),
                (p < 1 ? p + len : (p > len ? p - len : p))),
          calc2(
              i,
              (i - 1 < 1 ? i - 1 + len : (i - 1 > len ? i - 1 - len : i - 1)),
              ((p < 1 ? p + len : (p > len ? p - len : p)) + 1 < 1
                   ? (p < 1 ? p + len : (p > len ? p - len : p)) + 1 + len
                   : ((p < 1 ? p + len : (p > len ? p - len : p)) + 1 > len
                          ? (p < 1 ? p + len : (p > len ? p - len : p)) + 1 -
                                len
                          : (p < 1 ? p + len : (p > len ? p - len : p)) + 1))));
    }
  }
  for (int i = 1; i < (int)V[id[rt]].size(); i++) {
    int v = V[id[rt]][i];
    for (int j = st[v]; j; j = vs[j].next) {
      if (id[vs[j].v] == id[v]) continue;
      SDFS(vs[j].v, v, max(Ans[v], (vs[j].v == p1[v] ? f2[v] : f1[v])) + 1);
    }
  }
  for (int i = 0; i < (int)V[id[rt]].size(); i++)
    Ans[V[id[rt]][i]] = max(Ans[V[id[rt]][i]], f1[V[id[rt]][i]]);
  Ans[rt] = max(Ans[rt], prs);
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= m; i++) {
    int u = read(), v = read();
    addedge(u, v);
    addedge(v, u);
  }
  dfs(1, 0);
  DFS(1, 0);
  SDFS(1, 0, 0);
  for (int i = 1; i <= n; i++) printf("%d ", Ans[i]);
  puts("");
  return 0;
}
