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;
template <typename T>
inline void chkmin(T &a, T b) {
  a = a < b ? a : b;
}
template <typename T>
inline void chkmax(T &a, T b) {
  a = a > b ? a : b;
}
const int MAXN = 500005, MAXM = 1500005;
template <const int N, const int M, typename T = int>
struct Graph {
  T to[M], bb[M];
  int aa[M], cnt[N], tot, n;
  void clear() {
    memset(cnt, 0, sizeof(cnt));
    tot = n = 0;
  }
  Graph() { clear(); }
  struct Point {
    T *beg, *ed;
    T *begin() { return beg; }
    T *end() { return ed; }
  } po[N];
  Point &operator[](int x) { return po[x]; }
  void addedge(int u, T v) { ++cnt[u], ++tot, aa[tot] = u, bb[tot] = v; }
  void init(int nn = 0) {
    n = nn;
    po[1].beg = po[1].ed = to;
    for (int i = 2; i <= n; i++)
      po[i].ed = po[i].beg = po[i - 1].beg + cnt[i - 1];
    for (int i = 1; i <= tot; i++) *(po[aa[i]].ed++) = bb[i];
  }
};
Graph<MAXN, MAXM> cac, tr;
int que[MAXM], out[MAXN], id[MAXN], n, m, tp, dcnt, bcnt;
int adj[MAXN], dfn[MAXN], sta[MAXN], low[MAXN], bel[MAXN];
vector<int> cir[MAXN];
void tarjan(int u, int fa) {
  dfn[u] = low[u] = ++dcnt, sta[++tp] = u;
  for (int v : cac[u]) {
    if (v == fa) continue;
    if (!dfn[v]) {
      tarjan(v, u);
      chkmin(low[u], low[v]);
    } else
      chkmin(low[u], dfn[v]);
  }
  if (dfn[u] == low[u]) {
    ++bcnt;
    while (sta[tp + 1] != u) {
      int v = sta[tp--];
      cir[bcnt].push_back(v);
      bel[v] = bcnt;
    }
    reverse(cir[bcnt].begin(), cir[bcnt].end());
    for (int i = 0; i < (int)cir[bcnt].size(); i++) id[cir[bcnt][i]] = i;
  }
}
int f[MAXN], g[MAXN], g1[MAXN], val[MAXM], ans[MAXN];
void dfs1(int u) {
  int s = cir[u].size();
  f[u] = s >> 1;
  for (int v : tr[u]) {
    dfs1(v);
    int q = adj[v], p = id[q];
    if (g[q] <= f[v])
      g1[q] = g[q], g[q] = f[v] + 1;
    else if (g1[q] <= f[v])
      g1[q] = f[v] + 1;
    chkmax(f[u], f[v] + 1 + min(p, s - p - 1));
  }
}
void dfs2(int u) {
  int m = cir[u].size(), a = m >> 1, b = m - a - 1;
  for (int i = 0; i < m; i++) {
    val[i] = g[cir[u][i]] - i;
    val[i + m] = val[i] - m;
    ans[i] = 0;
  }
  int he = 1, ta = 0;
  for (int i = 0; i < m << 1; i++) {
    if (i >= a && he <= ta) chkmax(ans[i % m], val[que[he]] + i);
    while (he <= ta && val[que[ta]] <= val[i]) --ta;
    que[++ta] = i;
    if (que[he] == i - a) ++he;
  }
  for (int i = 0; i < m; i++) {
    val[i] = g[cir[u][i]] + i;
    val[i + m] = val[i] + m;
  }
  he = 1, ta = 0;
  for (int i = (m << 1) - 1; i > 0; i--) {
    if (i < (m << 1) - b && he <= ta) chkmax(ans[i % m], val[que[he]] - i);
    while (he <= ta && val[que[ta]] <= val[i]) --ta;
    que[++ta] = i;
    if (que[he] == i + b) ++he;
  }
  for (int i = 0; i < m; i++) {
    int v = cir[u][i];
    out[v] = max(g[v], ans[i]);
    if (g[v] < ans[i])
      g1[v] = g[v], g[v] = ans[i];
    else if (g1[v] < ans[i])
      g1[v] = ans[i];
  }
  for (int v : tr[u]) {
    int p = adj[v], q = (f[v] + 1 == g[p] ? g1[p] : g[p]) + 1;
    if (g[p = cir[v][0]] < q)
      g1[p] = g[p], g[p] = q;
    else if (g1[p] < q)
      g1[p] = q;
    dfs2(v);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    cac.addedge(u, v);
    cac.addedge(v, u);
  }
  cac.init(n);
  tarjan(1, 0);
  for (int i = 1; i <= n; i++)
    for (int j : cac[i])
      if (bel[j] < bel[i]) {
        tr.addedge(bel[i], bel[j]);
        adj[bel[j]] = i;
      }
  tr.init(bcnt);
  dfs1(bcnt);
  dfs2(bcnt);
  for (int i = 1; i <= n; i++) printf("%d ", out[i]);
  return 0;
}
