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 N = 500010;
vector<int> e[N];
int bcircle[N];
vector<int> circle[N];
int up[N], down[N];
int n;
bool vis[N];
int pre[N];
int num_circle;
int f[N];
struct node {
  int max_value, max_which;
  int sec_value, sec_which;
  node() {
    max_value = max_which = 0;
    sec_value = sec_which = 0;
  }
  void change_max(int value, int which) {
    sec_value = max_value;
    sec_which = max_which;
    max_value = value;
    max_which = which;
  }
  void change_sec(int value, int which) {
    sec_value = value;
    sec_which = which;
  }
} dp[N];
int mx1[N << 2], mx2[N << 2];
int w[N], top[N];
void pushup(int x) {
  mx1[x] = max(mx1[x + x], mx1[x + x + 1]);
  mx2[x] = max(mx2[x + x], mx2[x + x + 1]);
}
void build(int l, int r, int x) {
  if (l == r) {
    mx1[x] = w[l] - l;
    mx2[x] = w[l] + r;
    return;
  }
  if (l != r) {
    int m = (l + r) >> 1;
    build(l, m, x + x);
    build(m + 1, r, x + x + 1);
    pushup(x);
  }
}
void update(pair<int, int> &ret, pair<int, int> tmp) {
  if (tmp.first > ret.first) {
    ret.first = tmp.first;
  }
  if (tmp.second > ret.second) {
    ret.second = tmp.second;
  }
}
pair<int, int> query(int L, int R, int l, int r, int x) {
  if (L > R) {
    return make_pair(-n, -n);
  }
  if (L <= l && r <= R) {
    return make_pair(mx1[x], mx2[x]);
  }
  pair<int, int> ret = make_pair(-n, -n);
  int m = (l + r) >> 1;
  if (L <= m) {
    pair<int, int> tmp = query(L, R, l, m, x + x);
    update(ret, tmp);
  }
  if (R > m) {
    pair<int, int> tmp = query(L, R, m + 1, r, x + x + 1);
    update(ret, tmp);
  }
  return ret;
}
void init() {
  dp[0].max_value = -1;
  memset(top, -1, sizeof(top));
  memset(bcircle, -1, sizeof(bcircle));
}
void update(int u, int value, int v) {
  if (value >= dp[u].max_value) {
    dp[u].change_max(value, v);
  } else if (value > dp[u].sec_value) {
    dp[u].change_sec(value, v);
  }
}
void solve_circle(int id) {
  int sz = (int)circle[id].size();
  for (int i = 0; i < sz; i++) {
    w[i] = dp[circle[id][i]].max_value;
  }
  build(0, sz - 1, 1);
  for (int i = 0; i < sz; i++) {
    int k = (i + (sz + 1) / 2) % sz;
    if (k > i) {
      pair<int, int> ret1 = query(i + 1, k - 1, 0, sz - 1, 1);
      pair<int, int> ret2 = query(0, i - 1, 0, sz - 1, 1);
      pair<int, int> ret3 = query(k, sz - 1, 0, sz - 1, 1);
      int tmp = max(ret1.second - i, ret2.first + i);
      tmp = max(tmp, ret3.first + i + sz);
      update(circle[id][i], tmp, -1);
    } else {
      pair<int, int> ret1 = query(k, i - 1, 0, sz - 1, 1);
      pair<int, int> ret2 = query(i + 1, sz - 1, 0, sz - 1, 1);
      pair<int, int> ret3 = query(0, k - 1, 0, sz - 1, 1);
      int tmp = max(ret1.first + i, ret2.second - i);
      tmp = max(tmp, sz - i + ret3.second);
      update(circle[id][i], tmp, -1);
    }
  }
}
int dep[N];
void find_circle(int u, int fa) {
  vis[u] = true;
  pre[u] = fa;
  dep[u] = dep[fa] + 1;
  for (int v : e[u]) {
    if (!vis[v]) {
      find_circle(v, u);
    } else if (v != fa && dep[v] < dep[u]) {
      top[v] = 1;
      int x = u;
      num_circle++;
      do {
        bcircle[x] = num_circle;
        circle[num_circle].emplace_back(x);
        x = pre[x];
      } while (x != pre[v]);
      reverse(circle[num_circle].begin(), circle[num_circle].end());
    }
  }
}
void dp_down(int u, int fa) {
  vis[u] = true;
  for (int v : e[u]) {
    if (!vis[v]) {
      dp_down(v, u);
      if (bcircle[v] == -1 || top[v] != -1) {
        update(u, f[v] + 1, v);
      }
    }
  }
  f[u] = dp[u].max_value;
  if (top[u] != -1) {
    f[u] = dp[u].max_value;
    int id = bcircle[u];
    int sz = (int)circle[id].size();
    int tmp = 0;
    for (int i = 1; i < (sz + 1) / 2; i++) {
      tmp = max(tmp, i + dp[circle[id][i]].max_value);
    }
    for (int i = (sz + 1) / 2; i < sz; i++) {
      tmp = max(tmp, sz - i + dp[circle[id][i]].max_value);
    }
    f[u] = max(f[u], tmp);
  }
}
void dp_up(int u, int fa) {
  if (bcircle[u] == -1 || top[u] != -1) {
    if (dp[fa].max_which != u) {
      update(u, dp[fa].max_value + 1, fa);
    } else {
      update(u, dp[fa].sec_value + 1, fa);
    }
  }
  if (top[u] != -1) {
    solve_circle(bcircle[u]);
    int id = bcircle[u];
  }
  vis[u] = true;
  for (int v : e[u]) {
    if (!vis[v]) {
      dp_up(v, u);
    }
  }
}
void input() {
  int a, b, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &a, &b);
    e[a].emplace_back(b);
    e[b].emplace_back(a);
  }
}
void output() {
  for (int i = 1; i <= n; i++) {
    printf("%d ", dp[i].max_value);
  }
}
int main() {
  init();
  input();
  find_circle(1, 0);
  memset(vis, false, sizeof(vis));
  dp_down(1, 0);
  memset(vis, false, sizeof(vis));
  dp_up(1, 0);
  output();
  return 0;
}
