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>
#pragma GCC optimize("Ofast")
using namespace std;
inline char Sc() {
  static const int LEN = 100000;
  static char Buf[LEN], *OP = Buf, *ED = Buf;
  if (OP == ED) {
    ED = (OP = Buf) + fread(Buf, 1, LEN, stdin);
    if (OP == ED) return -1;
  }
  return *OP++;
}
template <class T>
inline void Rd(T &x) {
  static char c;
  for (x = 0, c = Sc(); c < 48; c = Sc())
    ;
  for (; c > 47; c = Sc()) x = (x << 1) + (x << 3) + (c ^ 48);
}
int n, m;
int head[500005], tot;
struct Edge {
  int nxt, to;
} G[500005 * 6];
void addedge(int x, int y) {
  G[tot] = (Edge){head[x], y};
  head[x] = tot++;
}
int Q1[500005], st[500005], ed[500005], col[500005];
struct Tarjan {
  int dfn[500005], low[500005], co, vis[500005], Stk[500005], stk, T, T1;
  void Solve(int x, int fa) {
    dfn[x] = low[x] = ++T;
    vis[x] = 1;
    Stk[++stk] = x;
    for (int i = head[x]; i != -1; i = G[i].nxt) {
      int y = G[i].to;
      if (y == fa) continue;
      if (!dfn[y]) {
        Solve(y, x);
        low[x] = min(low[x], low[y]);
      } else if (vis[y])
        low[x] = min(low[x], dfn[y]);
    }
    if (dfn[x] == low[x]) {
      int j;
      co++;
      st[co] = T1 + 1;
      do {
        j = Stk[stk--];
        col[j] = co;
        vis[j] = 0;
        Q1[++T1] = j;
      } while (x != j);
      ed[co] = T1;
    }
  }
  void solve() { Solve(1, 0); }
} Tarjan;
int dp[500005][2], W[500005][2];
struct BFS {
  int Q[500005], vis[500005], fa[500005], dis[500005];
  void solve() {
    int L = 1, R = 1;
    Q[R++] = 1;
    vis[1] = 1;
    while (L < R) {
      int x = Q[L++];
      for (int i = head[x]; i != -1; i = G[i].nxt) {
        int y = G[i].to;
        if (vis[y]) continue;
        fa[y] = x;
        vis[y] = 1;
        Q[R++] = y;
      }
    }
    dis[0] = -1;
    for (int i = n; i > 1; i--) {
      int x = Q[i], v = dis[x] + 1, y = fa[x];
      if (col[x] != col[y]) {
        if (v > dp[y][0]) {
          dp[y][1] = dp[y][0];
          W[y][1] = W[y][0];
          dp[y][0] = v;
          W[y][0] = x;
        } else if (v > dp[y][1]) {
          dp[y][1] = v;
          W[y][1] = x;
        }
      }
      dis[y] = max(dis[y], dis[x] + 1);
    }
  }
} BFS;
int Len[500005], dis[500005];
int Q[500005];
int D(int x) { return dp[Q1[x]][0]; }
int Dis(int x, int y) {
  int c = col[Q1[x]];
  int d1 = abs(x - y);
  int d2 = (ed[c] - st[c] + 1) - d1;
  return min(d1, d2);
}
int Nxt(int x, int len) {
  int c = col[Q1[x]];
  if (x - len >= st[c]) return x - len;
  return ed[c] - (len - (x - st[c] + 1));
}
void Pop(int x, int &L) {
  if (Q[L] == x) L++;
}
void Push(int &L, int &R, int x, int y) {
  while (L <= R && D(Q[R]) + Dis(Q[R], y) <= D(x) + Dis(x, y)) R--;
  Q[++R] = x;
}
void Calc(int c1) {
  int len = ed[c1] - st[c1] + 1;
  int L = 1, R = 0;
  for (int i = ed[c1] - 1; i >= ed[c1] - len / 2; i--) {
    Push(L, R, i, ed[c1]);
  }
  for (int i = ed[c1]; i >= st[c1]; i--) {
    Pop(i, L);
    int x = Q1[i];
    dis[x] = max(dis[x], Dis(i, Q[L]) + D(Q[L]));
    Push(L, R, Nxt(i, len / 2 + 1), i - 1);
  }
}
void f1(int x, int fa) {
  int c1 = col[x];
  if (fa != 0) {
    Len[x] = max(Len[fa], dis[fa]) + 1;
    if (W[fa][0] != x)
      Len[x] = max(Len[x], dp[fa][0] + 1);
    else
      Len[x] = max(Len[x], dp[fa][1] + 1);
  }
  for (int i = st[c1]; i < ed[c1]; i++) Len[Q1[i]] = Len[x] + Dis(i, ed[c1]);
  int len = ed[c1] - st[c1];
  if (len) {
    Calc(c1);
    for (int i = st[c1]; i < st[c1] + len / 2; i++)
      swap(Q1[i], Q1[ed[c1] - i + st[c1] - 1]);
    Calc(c1);
    for (int i = st[c1]; i < st[c1] + len / 2; i++)
      swap(Q1[i], Q1[ed[c1] - i + st[c1] - 1]);
  }
  for (int i = st[c1]; i <= ed[c1]; i++) {
    int x1 = Q1[i];
    for (int j = head[x1]; j != -1; j = G[j].nxt) {
      int y = G[j].to;
      if (col[y] == c1) continue;
      if (col[y] == col[fa]) continue;
      f1(y, x1);
    }
  }
}
int main() {
  memset(head, -1, sizeof head);
  Rd(n);
  Rd(m);
  for (int i = 1; i <= m; i++) {
    int x, y;
    Rd(x);
    Rd(y);
    addedge(x, y);
    addedge(y, x);
  }
  Tarjan.solve();
  BFS.solve();
  f1(1, 0);
  for (int i = 1; i <= n; i++)
    printf("%d ", max(max(dis[i], Len[i]), dp[i][0]));
  return 0;
}
