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 std ::reverse;
using std ::vector;
template <typename T>
T max(T x, T y) {
  return (x > y) ? x : y;
}
template <typename T>
T min(T x, T y) {
  return (x < y) ? x : y;
}
template <typename T>
bool chkmax(T &x, T y) {
  return (x >= y) ? 0 : (x = y, 1);
}
template <typename T>
bool chkmin(T &x, T y) {
  return (x <= y) ? 0 : (x = y, 1);
}
template <typename T>
T read(T &in) {
  in = 0;
  char ch;
  T f = 1;
  while (!isdigit(ch = getchar()))
    if (ch == '-') f = -1;
  while (isdigit(ch)) in = in * 10 + ch - '0', ch = getchar();
  return in *= f;
}
static const int max1 = 500000 + 11;
static const int max2 = 2000000 + 11;
int Ct = 1, Ht[max1], Nt[max2], to[max2];
void ins(int x, int y) {
  Nt[++Ct] = Ht[x], Ht[x] = Ct, to[Ct] = y;
  Nt[++Ct] = Ht[y], Ht[y] = Ct, to[Ct] = x;
}
int n, m;
int dt, dfn[max1], low[max1];
bool isB[max2], vis[max1];
int stack[max1], *top = stack;
int cnt, atC[max1];
int mL[max1], L[max1], Z[max1];
vector<int> C[max1];
void Tarjan(int x, int fa) {
  int y;
  dfn[x] = low[x] = ++dt, *(++top) = x;
  for (int i = (Ht[x]); i; i = (Nt[i]))
    if (to[i] != fa) {
      y = to[i];
      if (!dfn[y]) {
        Tarjan(y, x), chkmin(low[x], low[y]);
        if (low[y] > low[x]) isB[i] = isB[i ^ 1] = 1;
      } else
        chkmin(low[x], dfn[y]);
    }
  if (dfn[x] != low[x]) return;
  ++cnt;
  do {
    y = *(top--);
    atC[y] = cnt;
    C[cnt].push_back(y);
  } while (x != y);
}
void GetBfsTree() {
  static int que[max1], fa[max1];
  int *front = que, *back = que;
  *(++back) = 1, vis[1] = 1;
  while (front < back) {
    int x = *(++front);
    for (int i = (Ht[x]); i; i = (Nt[i]))
      if (!vis[to[i]]) vis[to[i]] = 1, fa[to[i]] = x, *(++back) = to[i];
  }
  for (int _q = (n), _qr = (1); _q >= (_qr); --_q) {
    int x = que[_q];
    for (int i = (Ht[x]); i; i = (Nt[i]))
      if (fa[to[i]] == x) {
        chkmax(mL[x], mL[to[i]] + 1);
        if (isB[i]) chkmax(L[x], mL[to[i]] + 1);
      }
  }
}
void solve(int now, int fa, int upd) {
  static int q[max2], que[max2];
  int *front = que + 1, *back = que;
  chkmax(L[now], upd);
  int qt = (int)C[atC[now]].size();
  for (int i = (1), ir = (qt); i <= (ir); ++i)
    q[i] = q[i + qt] = C[atC[now]][i - 1];
  for (int twice = (0), twicer = (1); twice <= (twicer); ++twice) {
    front = que + 1, back = que;
    for (int i = ((qt >> 1) + qt), ir = (1 + qt); i >= (ir); --i) {
      while (front <= back && L[q[i]] + i > L[q[*back]] + *back) --back;
      *(++back) = i;
    }
    for (int i = (qt), ir = (1); i >= (ir); --i) {
      while (front <= back && *front - i > (qt >> 1)) ++front;
      if (front <= back) chkmax(Z[q[i]], L[q[*front]] + *front - i);
      while (front <= back && L[q[i]] + i > L[q[*back]] + *back) --back;
      *(++back) = i;
    }
    reverse(1 + q, 1 + (qt << 1) + q);
  }
  vector<int>::iterator x;
  for (x = C[atC[now]].begin(); x != C[atC[now]].end(); ++x) {
    int fMax = 0, sMax = 0;
    for (int i = (Ht[*x]); i; i = (Nt[i]))
      if (to[i] != fa && isB[i]) {
        if (chkmax(sMax, mL[to[i]] + 1)) {
          if (sMax > fMax) std ::swap(sMax, fMax);
        }
      }
    for (int i = (Ht[*x]); i; i = (Nt[i]))
      if (to[i] != fa && isB[i]) {
        int n_upd = max(Z[*x], upd);
        if (mL[to[i]] + 1 == fMax)
          chkmax(n_upd, sMax);
        else
          chkmax(n_upd, fMax);
        solve(to[i], *x, n_upd + 1);
      }
  }
}
int main() {
  read(n), read(m);
  for (int i = (1), ir = (m); i <= (ir); ++i) {
    int x, y;
    read(x), read(y);
    ins(x, y);
  }
  Tarjan(1, 0);
  GetBfsTree();
  solve(1, 0, 0);
  for (int i = (1), ir = (n); i <= (ir); ++i) printf("%d ", max(L[i], Z[i]));
  putchar(10);
  return 0;
}
