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;
class MaxQueue {
  queue<pair<int, int> > q;
  list<pair<int, int> > l;
  int cnt = 0;

 public:
  MaxQueue() : cnt(0) {}
  void push(int x) {
    pair<int, int> cur = pair<int, int>(x, cnt++);
    while (!l.empty() && l.back() <= cur) l.pop_back();
    q.push(cur);
    l.push_back(cur);
  }
  int front() { return q.front().first; }
  void pop() {
    if (q.front().second == l.front().second) l.pop_front();
    q.pop();
  }
  int max() { return l.front().first; }
  int size() { return q.size(); }
};
int n, m;
vector<int> g[500309], st;
int cycle[500309], num[500309], pos[500309], par[500309];
int cnt = 0;
vector<int> cycles[500309];
int down[500309], up[500309];
void buildcycles(int u, int p) {
  num[u] = 1;
  pos[u] = st.size();
  st.push_back(u);
  for (int v : g[u]) {
    if (v == p)
      continue;
    else if (num[v] == 1 && cycle[u] == -1) {
      cycles[cnt].clear();
      for (int i = pos[v]; i <= pos[u]; i++) {
        cycle[st[i]] = cnt;
        cycles[cnt].push_back(st[i]);
      }
      cnt++;
    } else if (num[v] == 0) {
      buildcycles(v, u);
      if (cycle[u] == -1 || cycle[v] != cycle[u]) par[v] = u;
    }
  }
  num[u] = 2;
  st.pop_back();
}
int find(vector<int>& v, int u) {
  for (int i = 0; (i) < (int(v.size())); (i)++) {
    if (v[i] == u) return i;
  }
  return -1;
}
int nodedown(int u);
int cycledown(int u) {
  if (down[u] != -1) return down[u];
  int c = cycle[u];
  if (c == -1) return nodedown(u);
  vector<int>& arr = cycles[c];
  int sz = arr.size();
  nodedown(u);
  int j = find(arr, u);
  assert(j != -1);
  for (int i = 0; (i) < (sz); (i)++) {
    int d = abs(i - j);
    if (i == j) continue;
    down[u] = max(down[u], min(d, sz - d) + nodedown(arr[i]));
  }
  return down[u];
}
int nodedown(int u) {
  if (down[u] != -1) return down[u];
  down[u] = 0;
  for (int v : g[u]) {
    if (v == par[u]) continue;
    if (cycle[u] != -1 && cycle[u] == cycle[v]) continue;
    down[u] = max(down[u], 1 + cycledown(v));
  }
  return down[u];
}
void solve(vector<int>& L, vector<int>& Z) {
  int sz = L.size();
  int k = sz / 2;
  for (int i = 0; (i) < (sz); (i)++) L.push_back(L[i]);
  vector<int> left = L, right = L;
  for (int i = 0; (i) < (2 * sz); (i)++) left[i] += i;
  for (int i = 0; (i) < (2 * sz); (i)++) right[i] += 2 * sz - i - 1;
  Z.assign(sz, 0);
  MaxQueue q;
  for (int i = 0; i < sz; i++) {
    q.push(right[i]);
  }
  while (q.size() > k) q.pop();
  for (int i = sz; i < 2 * sz; i++) {
    Z[i - sz] = max(Z[i - sz], q.max() - (2 * sz - i - 1));
    q.push(right[i]);
    q.pop();
  }
  q = MaxQueue();
  for (int i = 2 * sz - 1; i >= sz; i--) {
    q.push(left[i]);
  }
  while (q.size() > k) q.pop();
  for (int i = sz - 1; i >= 0; i--) {
    Z[i] = max(Z[i], q.max() - i);
    q.push(left[i]);
    q.pop();
  }
}
void nodeup(int u, int d);
void cycleup(int u, int d) {
  int c = cycle[u];
  if (c == -1) {
    nodeup(u, d);
    return;
  }
  cycledown(u);
  vector<int>& arr = cycles[c];
  int sz = arr.size();
  up[u] = d;
  int j = find(arr, u);
  assert(j != -1);
  vector<int> L(sz), Z;
  int daux = d;
  for (int v : g[u]) {
    if (v == par[u]) continue;
    if (cycle[u] != -1 && cycle[u] == cycle[v]) continue;
    daux = max(daux, 1 + nodedown(v));
  }
  for (int i = 0; (i) < (sz); (i)++) {
    if (i == j)
      L[i] = daux;
    else
      L[i] = nodedown(arr[i]);
  }
  solve(L, Z);
  for (int i = 0; (i) < (sz); (i)++) {
    if (i == j)
      nodeup(arr[i], max(Z[i], d));
    else
      nodeup(arr[i], Z[i]);
  }
}
void nodeup(int u, int d) {
  up[u] = d;
  nodedown(u);
  int sz = g[u].size();
  int x = d, y = -1;
  for (int v : g[u]) {
    if (v == par[u]) continue;
    if (cycle[u] != -1 && cycle[u] == cycle[v]) continue;
    if (x >= y && 1 + nodedown(v) > y)
      y = 1 + down[v];
    else if (x < y && 1 + nodedown(v) > x)
      x = 1 + down[v];
  }
  for (int v : g[u]) {
    if (v == par[u]) continue;
    if (cycle[u] != -1 && cycle[u] == cycle[v]) continue;
    if (1 + nodedown(v) == max(x, y))
      cycleup(v, min(x, y) + 1);
    else
      cycleup(v, max(x, y) + 1);
  }
}
int main() {
  scanf("%d %d", &n, &m);
  for (int j = 0; (j) < (m); (j)++) {
    int u, v;
    scanf("%d %d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  memset(&cycle, -1, sizeof cycle);
  memset(&down, -1, sizeof down);
  memset(&up, -1, sizeof up);
  memset(&num, 0, sizeof num);
  buildcycles(1, -1);
  cycleup(1, 0);
  for (int u = 1; (u) <= (n); (u)++) {
    printf("%d ", max(up[u], down[u]));
  }
  printf("\n");
  return 0;
}
