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;
int he[1000050 >> 1], ne[1000050 << 1], to[1000050 << 1], tot;
int n, m, ds;
const int inf = 1e9;
inline void addedge(int x, int y) {
  to[++tot] = y;
  ne[tot] = he[x];
  he[x] = tot;
}
vector<int> v[1000050], ve[1000050];
int dfn[1000050 >> 1], low[1000050 >> 1], cnt, st[1000050 >> 1], tp;
inline void tarjan(int g) {
  dfn[g] = low[g] = ++cnt;
  st[++tp] = g;
  for (int i = he[g]; i; i = ne[i]) {
    if (dfn[to[i]])
      low[g] = min(low[g], dfn[to[i]]);
    else {
      tarjan(to[i]);
      low[g] = min(low[g], low[to[i]]);
      if (low[to[i]] == dfn[g]) {
        ++ds;
        v[g].push_back(ds);
        while (1) {
          int t = st[tp--];
          v[ds].push_back(t);
          if (t == to[i]) break;
        }
      }
    }
  }
}
int len[1000050], a[1000050];
inline void dfs(int g) {
  len[g] = g <= n ? 1 : 0;
  for (int i = 0, to; i < v[g].size(); ++i) {
    to = v[g][i], dfs(to);
    if (g <= n) len[g] = max(len[g], len[to] + 1);
  }
  int sz = v[g].size();
  if (!sz) return;
  if (g > n) {
    a[sz] = 0;
    for (int i = sz - 1; ~i; --i)
      a[i] = max(len[v[g][i]] + sz - 1 - i, a[i + 1]);
    len[g] = a[0];
    for (int i = 0, ma = 0; i < sz; ++i) {
      ma = max(ma, len[v[g][i]] + i);
      len[g] = min(len[g], max(ma, a[i + 1]));
    }
  }
}
int ans[1000050 << 1];
int ma1[1000050 << 3], ma2[1000050 << 3];
inline void build(int g, int l, int r) {
  if (l == r) {
    ma1[g] = a[l] - l;
    ma2[g] = a[l] + l;
    return;
  }
  const int m = l + r >> 1;
  build(g << 1, l, m);
  build(g << 1 | 1, m + 1, r);
  ma1[g] = max(ma1[g << 1], ma1[g << 1 | 1]);
  ma2[g] = max(ma2[g << 1], ma2[g << 1 | 1]);
}
inline int ask1(int g, int l, int r, int x, int y) {
  if (l > y || r < x) return -inf;
  if (l >= x && r <= y) return ma1[g];
  const int m = l + r >> 1;
  int r1 = ask1(g << 1, l, m, x, y), r2 = ask1(g << 1 | 1, m + 1, r, x, y);
  return max(r1, r2);
}
inline int ask2(int g, int l, int r, int x, int y) {
  if (l > y || r < x) return -inf;
  if (l >= x && r <= y) return ma2[g];
  const int m = l + r >> 1;
  int r1 = ask2(g << 1, l, m, x, y), r2 = ask2(g << 1 | 1, m + 1, r, x, y);
  return max(r1, r2);
}
inline int getans(int id, int L, int R, int ma) {
  int l = L, r = R;
  while (l + 1 < r) {
    int mid = l + r >> 1;
    if (ask2(1, 1, ma, L, mid) - L <= ask1(1, 1, ma, mid + 1, R) + R)
      l = mid;
    else
      r = mid;
  }
  int l1 = ask2(1, 1, ma, L, l) - L, l2 = ask1(1, 1, ma, l + 1, R) + R;
  l1 = max(l1, l2);
  int r1 = ask2(1, 1, ma, L, r) - L, r2 = ask1(1, 1, ma, r + 1, R) + R;
  r1 = max(r1, r2);
  return min(l1, r1);
}
int sz, ma;
inline void dfs2(int g, int fa) {
  ans[g] = len[g] - 1;
  sz = v[g].size();
  if (!sz) return;
  ve[g].resize(sz);
  if (g <= n) {
    a[sz] = 0;
    for (int i = sz - 1; ~i; --i) a[i] = max(len[v[g][i]] + 1, a[i + 1]);
    for (int i = 0, ma = 0; i < sz; ++i) {
      len[g] = len[fa] + 1;
      len[g] = max(len[g], ma);
      len[g] = max(len[g], a[i + 1]);
      ma = max(ma, len[v[g][i]] + 1);
      ve[g][i] = len[g];
    }
    for (int i = 0; i < v[g].size(); ++i) len[g] = ve[g][i], dfs2(v[g][i], g);
    return;
  }
  ma = sz + sz;
  a[sz] = len[fa];
  for (int i = 0; i < sz; ++i) a[i] = a[i + sz + 1] = len[v[g][i]];
  build(1, 1, ma);
  for (int i = 0; i < sz; ++i) ve[g][i] = getans(i, i + 1, i + sz, ma);
  for (int i = 0; i < v[g].size(); ++i) {
    len[g] = ve[g][i];
    len[v[g][i]] = max(len[v[g][i]], ve[g][i] + 1);
    dfs2(v[g][i], g);
  }
}
int b[30];
inline void dfs3(int g, int fa) {
  ans[g] = len[g] - 1;
  sz = v[g].size();
  if (!sz) return;
  ve[g].resize(sz);
  if (g <= n) {
    a[sz] = 0;
    for (int i = sz - 1; ~i; --i) a[i] = max(len[v[g][i]] + 1, a[i + 1]);
    for (int i = 0, ma = 0; i < sz; ++i) {
      len[g] = len[fa] + 1;
      len[g] = max(len[g], ma);
      len[g] = max(len[g], a[i + 1]);
      ma = max(ma, len[v[g][i]] + 1);
      ve[g][i] = len[g];
    }
    for (int i = 0; i < v[g].size(); ++i) len[g] = ve[g][i], dfs3(v[g][i], g);
    return;
  }
  ma = sz + sz;
  a[sz] = len[fa];
  for (int i = 0; i < sz; ++i) a[i] = a[i + sz + 1] = len[v[g][i]];
  for (int i = 0; i < sz; ++i) {
    b[i + sz + 1] = 0;
    for (int j = i + sz; j > i; --j) b[j] = max(a[j] + i + sz - j, b[j + 1]);
    len[g] = b[i + 1];
    for (int j = i + 1, ma = 0; j <= i + sz; ++j) {
      ma = max(ma, a[j] + j - i - 1);
      len[g] = min(len[g], max(ma, b[j + 1]));
    }
    ve[g][i] = len[g];
  }
  for (int i = 0; i < v[g].size(); ++i) {
    len[g] = ve[g][i];
    len[v[g][i]] = max(len[v[g][i]], ve[g][i] + 1);
    dfs3(v[g][i], g);
  }
}
inline void work2(int rt) {
  dfs3(rt, 0);
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  puts("");
}
int main() {
  scanf("%d%d", &n, &m);
  ds = n;
  for (int i = 1, x, y; i <= m; ++i) {
    scanf("%d%d", &x, &y);
    addedge(x, y), addedge(y, x);
  }
  int rt = 1;
  tarjan(rt);
  int masize = 0;
  for (int i = 1; i <= ds; ++i)
    if (v[i].size() > masize) masize = v[i].size();
  dfs(rt);
  if (masize < 10) return work2(rt), 0;
  dfs2(rt, 0);
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  puts("");
  return 0;
}
