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;
const int inf = (int)1e9;
const long long linf = (long long)1e18;
const int mod = (int)1e9 + 7;
const long double eps = (long double)1e-8;
const int maxn = (int)5e5 + 5;
const long double pi = acos(-1);
int n, m, cnt_cyc;
int t[maxn], cyc[maxn], tup[maxn];
int ans[maxn], ans1[maxn], cyc_head[maxn], p[maxn], d[maxn], dc[maxn],
    dc_up[maxn];
vector<int> a[maxn], cycv[maxn];
void dfs0(int v, int pr = -1) {
  p[v] = pr;
  t[v] = 1;
  tup[v] = 1;
  for (auto to : a[v]) {
    if (to == pr) continue;
    if (t[to] && tup[to] == 0) continue;
    if (t[to]) {
      cnt_cyc++;
      cyc[to] = cnt_cyc;
      int x = v;
      cycv[cnt_cyc].push_back(to);
      while (cyc[x] == 0) {
        cyc[x] = cnt_cyc;
        cycv[cnt_cyc].push_back(x);
        x = p[x];
      }
      cyc_head[cnt_cyc] = to;
    } else {
      dfs0(to, v);
    }
  }
  if (cyc[v] == 0) {
    cnt_cyc++;
    cyc[v] = cnt_cyc;
    cyc_head[cnt_cyc] = v;
    cycv[cnt_cyc].push_back(v);
  }
  tup[v] = 0;
}
void dfs_cyc0(int cv, int cpr = -1) {
  for (auto v : cycv[cv]) {
    for (auto to : a[v]) {
      if (cyc[to] == cpr || cyc[to] == cv) continue;
      dfs_cyc0(cyc[to], cv);
      d[v] = dc[cyc[to]] + 1;
    }
  }
  for (auto i = 0; i < ((int)(cycv[cv]).size()); ++i) {
    dc[cv] = max(d[cyc_head[cv]],
                 d[cycv[cv][i]] + min(i, ((int)(cycv[cv]).size()) - i));
  }
}
void dfs_cyc1(int cv, int cpr = -1) {
  for (auto i = 0; i < ((int)(cycv[cv]).size()); ++i) {
    int v = cycv[cv][i];
    ans1[v] = min(i, ((int)(cycv[cv]).size()) - i) + dc_up[cv];
    for (auto j = 0; j < ((int)(cycv[cv]).size()); ++j) {
      if (i == j) continue;
      int u = cycv[cv][j];
      int dist =
          min(abs(i - j), min(i, j) + ((int)(cycv[cv]).size()) - max(i, j));
      ans1[v] = max(ans1[v], d[u] + dist);
    }
    ans[v] = max(d[v], ans1[v]);
  }
  for (auto v : cycv[cv]) {
    multiset<int> qm;
    for (auto to : a[v]) {
      if (cyc[to] == cpr || cyc[to] == cv) continue;
      qm.insert(-(dc[cyc[to]] + 1));
      if (((int)(qm).size()) > 2) qm.erase(++(++qm.begin()));
    }
    for (auto to : a[v]) {
      if (cyc[to] == cpr || cyc[to] == cv) continue;
      if (((int)(qm).size()) == 1) {
        dc_up[cyc[to]] = ans1[v] + 1;
      } else {
        auto it = qm.begin();
        ++it;
        if (dc[cyc[to]] + 1 == -*it) --it;
        dc_up[cyc[to]] = max(ans1[v], -*it) + 1;
      }
      dfs_cyc1(cyc[to], cv);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (auto i = 0; i < m; ++i) {
    int x, y;
    cin >> x >> y;
    --x;
    --y;
    a[x].push_back(y);
    a[y].push_back(x);
  }
  memset((cyc), 0, sizeof(cyc));
  cnt_cyc = 0;
  memset((t), 0, sizeof(t));
  dfs0(0);
  memset((ans), 0, sizeof(ans));
  memset((ans1), 0, sizeof(ans1));
  memset((d), 0, sizeof(d));
  memset((dc), 0, sizeof(dc));
  memset((dc_up), 0, sizeof(dc_up));
  dfs_cyc0(cyc[0]);
  dfs_cyc1(cyc[0]);
  for (auto i = 0; i < n; ++i) {
    cout << ans[i] << " ";
  }
  return 0;
}
