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;
namespace IO {
char ss[1 << 18], *A = ss, *B = ss;
inline char gc() {
  return A == B && (B = (A = ss) + fread(ss, 1, 1 << 18, stdin), A == B) ? -1
                                                                         : *A++;
}
template <class T>
inline void Rd(T &x) {
  char c;
  while (c = gc(), (c < 48 || 57 < c) && c != -1)
    ;
  x = (c ^ 48);
  while (c = gc(), 47 < c && c < 58) x = (x << 3) + (x << 1) + (c ^ 48);
}
char sr[1 << 21], z[20];
int C = -1, Z;
inline void Ot() { fwrite(sr, 1, C + 1, stdout), C = -1; }
template <class T>
inline void Wt(T x) {
  if (C > 1 << 20) Ot();
  while (z[++Z] = x % 10 ^ 48, x /= 10)
    ;
  while (sr[++C] = z[Z], --Z)
    ;
  sr[++C] = '\n';
}
}  // namespace IO
template <class T>
inline bool chkmin(T &a, T const &b) {
  return a > b ? a = b, true : false;
}
template <class T>
inline bool chkmax(T &a, T const &b) {
  return a < b ? a = b, true : false;
}
const int M = 500005;
struct Queue {
  int pos[M << 1], val[M << 1];
  int head, tail;
  void clear() { head = tail = 0; }
  void push(int r, int x) {
    while (head < tail and val[tail - 1] < x) --tail;
    pos[tail] = r;
    val[tail] = x;
    ++tail;
  }
  int maxn(int l) {
    if (head < tail and pos[head] < l) ++head;
    return head < tail ? val[head] : 0;
  }
} Q0, Q1;
struct edge {
  int to;
  edge *next;
} * E[M], *G[M << 1], Pool[M * 6], *allc = Pool;
int dfn[M], low[M], Fa[M], dep[M];
int Q[M], A[M][2], B[M], val[M * 3], id[M];
int n, m, top, l, r, dfn_cnt, scc_cnt;
void add_edge(int u, int v, edge **G) {
  *allc = (edge){v, G[u]};
  G[u] = allc++;
}
void solve_ring(int u, int v) {
  int w = ++scc_cnt;
  int len = dep[v] - dep[u] + 1;
  for (int x = v, d = 1; x != u; x = Fa[x], ++d) {
    add_edge(w, x, G);
    chkmax(B[w - n], A[x][0] + min(d, len - d));
  }
  int tmp = B[w - n];
  for (int k = (0), k_end__ = (2); k < k_end__; ++k)
    if (tmp > A[u][k]) swap(tmp, A[u][k]);
  add_edge(u, w, G);
}
void Tarjan(int u, int fa) {
  low[u] = dfn[u] = ++dfn_cnt;
  for (edge *e = u[E]; e; e = e->next) {
    int v = e->to;
    if (v == fa) continue;
    if (!v[dfn]) {
      dep[v] = dep[u] + 1;
      Tarjan(v, Fa[v] = u);
      chkmin(low[u], low[v]);
    } else
      chkmin(low[u], dfn[v]);
  }
  for (edge *e = u[E]; e; e = e->next) {
    if ((Fa[e->to] != u and low[e->to] == dfn[u]) or low[e->to] > dfn[u])
      solve_ring(u, e->to);
  }
}
void solve(int u, int w) {
  int sz = 0;
  Q0.clear(), Q1.clear();
  val[sz] = A[u][B[w - n] == A[u][0]];
  id[sz++] = u;
  for (edge *e = G[w]; e; e = e->next) {
    Q[r++] = id[sz] = e->to;
    val[sz] = A[e->to][0];
    ++sz;
  }
  for (int i = (0), i_end__ = (sz); i < i_end__; ++i)
    val[i + sz + sz] = val[i + sz] = val[i];
  int len0 = sz >> 1, pos0 = sz + 1;
  int len1 = sz - len0 - 1, pos1 = sz + len1 + 2;
  for (int i = (pos0 - len0), i_end__ = (pos0); i < i_end__; ++i)
    Q0.push(i, val[i] - i);
  for (int i = (pos1 - len1), i_end__ = (pos1); i < i_end__; ++i)
    Q1.push(i, val[i] + i);
  for (int i = (1), i_end__ = (sz); i < i_end__; ++i) {
    int u = id[i];
    int x = Q0.maxn(pos0 - len0) + i + sz;
    int y = Q1.maxn(pos1 - len1) - i - sz;
    for (int k = (0), k_end__ = (2); k < k_end__; ++k)
      if (x > A[u][k]) swap(x, A[u][k]);
    for (int k = (0), k_end__ = (2); k < k_end__; ++k)
      if (y > A[u][k]) swap(y, A[u][k]);
    Q0.push(pos0, val[pos0] - pos0), ++pos0;
    Q1.push(pos1, val[pos1] + pos1), ++pos1;
  }
}
int main() {
  IO::Rd(n), IO::Rd(m);
  while (m--) {
    int u, v;
    IO::Rd(u), IO::Rd(v);
    add_edge(u, v, E);
    add_edge(v, u, E);
  }
  scc_cnt = n;
  Tarjan(1, -1);
  Q[r++] = 1;
  while (l < r) {
    int u = Q[l++];
    for (edge *e = G[u]; e; e = e->next) {
      solve(u, e->to);
    }
  }
  for (int i = (1), i_end__ = (n + 1); i < i_end__; ++i) IO::Wt(A[i][0]);
  return IO::Ot(), 0;
}
