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 MAXN = 5e5 + 10;
int n, m, dp[MAXN], level[MAXN];
int dist[MAXN], val[MAXN * 3];
int local[MAXN], answer[MAXN];
vector<pair<int, int>> adj[MAXN], nex[MAXN];
bool cut_edge[MAXN * 3];
bool mark[MAXN];
void dfs_cut_edge(int v, int par = 0) {
  dp[v] = level[v] = level[par] + 1;
  mark[v] = true;
  for (auto i : adj[v]) {
    if (!mark[i.first]) {
      dfs_cut_edge(i.first, v);
      dp[v] = min(dp[v], dp[i.first]);
      if (dp[i.first] > level[v]) cut_edge[i.second] = true;
    } else if (i.first != par)
      dp[v] = min(dp[v], level[i.first]);
  }
}
void bfs(int v) {
  queue<int> q;
  dist[v] = 1;
  q.push(v);
  while (q.size()) {
    int tp = q.front();
    q.pop();
    for (auto i : adj[tp]) {
      if (!dist[i.first]) {
        dist[i.first] = dist[tp] + 1;
        q.push(i.first);
      }
      if (dist[i.first] == (dist[tp] + 1)) nex[tp].push_back(i);
    }
  }
}
void dfs_(int v, int par = 0) {
  mark[v] = true;
  for (auto i : nex[v]) {
    if (!mark[i.first]) dfs_(i.first, v);
    dp[v] = max(dp[v], dp[i.first] + 1);
    if (cut_edge[i.second]) val[i.second] = dp[i.first] + 1;
  }
}
inline int get_dist(int l, int r, int len) {
  if (l > r) return len - l + r;
  return r - l;
}
inline int get_(pair<int, int> p, int id, int len) {
  return p.first + get_dist(p.second, id, len);
}
void dfs(int v, int par = 0) {
  mark[v] = true;
  vector<int> cycle;
  cycle.push_back(v);
  while (true) {
    bool re = false;
    for (auto i : adj[cycle.back()])
      if (!mark[i.first] && !cut_edge[i.second]) {
        cycle.push_back(i.first);
        mark[i.first] = true;
        re = true;
        break;
      }
    if (!re) break;
  }
  for (auto v : cycle)
    for (auto e : adj[v])
      if (cut_edge[e.second]) local[v] = max(local[v], val[e.second]);
  int len = cycle.size();
  deque<pair<int, int>> deq;
  for (int i = (len / 2); i; i--) {
    int v = cycle[len - i];
    pair<int, int> me(local[v], len - i);
    while (deq.size() && get_(me, 0, len) >= get_(deq.back(), 0, len))
      deq.pop_back();
    deq.push_back(me);
  }
  for (int i = 0; i < len; i++) {
    while (deq.size() && get_dist(deq.front().second, i, len) > (len / 2))
      deq.pop_front();
    if (deq.size()) dp[cycle[i]] = get_(deq.front(), i, len);
    if (i == (len - 1)) break;
    int v = cycle[i];
    pair<int, int> me(local[v], i);
    while (deq.size() && get_(me, i + 1, len) >= get_(deq.back(), i + 1, len))
      deq.pop_back();
    deq.push_back(me);
  }
  deq.clear();
  reverse(cycle.begin(), cycle.end());
  for (int i = ((len - 1) / 2); i; i--) {
    int v = cycle[len - i];
    pair<int, int> me(local[v], len - i);
    while (deq.size() && get_(me, 0, len) >= get_(deq.back(), 0, len))
      deq.pop_back();
    deq.push_back(me);
  }
  for (int i = 0; i < len; i++) {
    while (deq.size() && get_dist(deq.front().second, i, len) > ((len - 1) / 2))
      deq.pop_front();
    if (deq.size()) dp[cycle[i]] = max(dp[cycle[i]], get_(deq.front(), i, len));
    if (i == (len - 1)) break;
    int v = cycle[i];
    pair<int, int> me(local[v], i);
    while (deq.size() && get_(me, i + 1, len) >= get_(deq.back(), i + 1, len))
      deq.pop_back();
    deq.push_back(me);
  }
  for (auto i : cycle) answer[i] = max(dp[i], local[i]);
  for (auto i : cycle) {
    int id = 0, mx = 0, smx = 0;
    for (auto e : adj[i])
      if (cut_edge[e.second])
        if (val[e.second] > mx) {
          mx = val[e.second];
          id = e.first;
        }
    for (auto e : adj[i])
      if (cut_edge[e.second] && e.first != id) smx = max(smx, val[e.second]);
    for (auto e : adj[i])
      if (cut_edge[e.second] && !mark[e.first]) {
        if (e.first == id) {
          val[e.second] = max(dp[i], smx) + 1;
          dfs(e.first, i);
        } else {
          val[e.second] = max(dp[i], mx) + 1;
          dfs(e.first, i);
        }
      }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back({v, i});
    adj[v].push_back({u, i});
  }
  dfs_cut_edge(1);
  bfs(1);
  memset(mark, 0, sizeof(mark));
  memset(dp, 0, sizeof(dp));
  dfs_(1);
  memset(mark, 0, sizeof(mark));
  memset(dp, 0, sizeof(dp));
  dfs(1);
  for (int i = 1; i <= n; i++) cout << answer[i] << ' ';
  return 0;
}
