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>
#pragma GCC optimize("Ofast")
using namespace std;
template <class _>
void chkmin(_ &a, _ b) {
  if (a > b) a = b;
}
template <class _>
void chkmax(_ &a, _ b) {
  if (a < b) a = b;
}
int n, m;
int tid;
int tim;
int dfn_cnt;
int dfn[500005];
int low[500005];
int col[500005];
int Cir[500005];
int St[500005];
int Ed[500005];
int Stk[500005];
int top;
struct node {
  int to, id;
};
vector<node> G[500005];
void Tarjan(int x, int id) {
  dfn[x] = low[x] = ++dfn_cnt;
  Stk[++top] = x;
  for (int i = 0; i < (int)G[x].size(); i++) {
    node y = G[x][i];
    if (y.id == id) continue;
    if (!dfn[y.to]) {
      Tarjan(y.to, y.id);
      chkmin(low[x], low[y.to]);
    } else
      chkmin(low[x], dfn[y.to]);
  }
  if (low[x] == dfn[x]) {
    int y = 0;
    tid++;
    St[x] = tim + 1;
    col[x] = tid;
    do {
      y = Stk[top--];
      col[y] = tid;
      Cir[++tim] = y;
    } while (y != x);
    Ed[x] = tim;
    for (int i = (St[x]), i_end_ = (Ed[x]); i <= i_end_; i++) {
      if (i > (St[x] + Ed[x]) / 2) break;
      swap(Cir[i], Cir[Ed[x] - (i - St[x])]);
    }
  }
}
int Q[500005];
int L, R;
int vis[500005];
int dis[500005];
int dp[500005];
int Fa[500005];
int Mark[500005];
int Max[500005][2];
int pos[500005][2];
void Update(int x, int y) {
  if (Max[x][0] <= dis[y] + 1) {
    Max[x][1] = Max[x][0];
    pos[x][1] = pos[x][0];
    Max[x][0] = dis[y] + 1;
    pos[x][0] = y;
  } else if (Max[x][1] < dis[y] + 1) {
    Max[x][1] = dis[y] + 1;
    pos[x][1] = y;
  }
}
void bfs() {
  L = 1, R = 0;
  Q[++R] = 1;
  vis[1] = 1;
  while (L <= R) {
    int a = Q[L++];
    for (int i = 0; i < (int)G[a].size(); i++) {
      int y = G[a][i].to;
      if (vis[y]) continue;
      vis[y] = 1;
      Fa[y] = a;
      Q[++R] = y;
    }
  }
  for (int i = (n), i_end_ = (1); i >= i_end_; i--) {
    int y = Q[i];
    int x = Fa[y];
    if (x == 0) continue;
    chkmax(dis[x], dis[y] + 1);
    if (col[x] == col[y]) continue;
    Update(x, y);
  }
}
struct Node {
  int id, val;
} S[500005];
int len;
int Len(int a, int b) {
  if (a >= b)
    return a - b + 1;
  else
    return len + 1 - (b - a);
}
void dfs(int x, int f, int d) {
  len = Ed[x] - St[x] + 1;
  Mark[x] = 1;
  for (int i = (St[x]), i_end_ = (Ed[x]); i <= i_end_; i++) Mark[Cir[i]] = 1;
  dp[x] = d;
  if (len != 1) {
    int t = len / 2 + 1;
    L = 1, R = 0;
    for (int i = (t), i_end_ = (1); i >= i_end_; i--) {
      int id = Cir[i + St[x] - 1];
      int val = Max[id][0];
      if (i == 1) chkmax(val, d);
      if (i == 1) chkmax(dp[x], S[L].val + Len(S[L].id, 1) - 1);
      while (L <= R && S[R].val + Len(S[R].id, 1) <= val + Len(i, 1)) R--;
      S[++R] = (Node){i, val};
    }
    for (int i = (len), i_end_ = (1); i >= i_end_; i--) {
      int id = Cir[i + St[x] - 1];
      int val = Max[id][0];
      while (L <= R && Len(S[L].id, i) > t) L++;
      chkmax(dp[id], S[L].val + Len(S[L].id, i) - 1);
      while (L <= R && S[R].val + Len(S[R].id, i) - 1 <= val) R--;
      S[++R] = (Node){i, val};
    }
    for (int i = (St[x] + 1), i_end_ = (Ed[x]); i <= i_end_; i++) {
      if (i > (St[x] + Ed[x]) / 2) break;
      swap(Cir[i], Cir[Ed[x] + St[x] + 1 - i]);
    }
    L = 1, R = 0;
    for (int i = (t), i_end_ = (1); i >= i_end_; i--) {
      int id = Cir[i + St[x] - 1];
      int val = Max[id][0];
      if (i == 1) chkmax(val, d);
      if (i == 1) chkmax(dp[x], S[L].val + Len(S[L].id, 1) - 1);
      while (L <= R && S[R].val + Len(S[R].id, 1) <= val + Len(i, 1)) R--;
      S[++R] = (Node){i, val};
    }
    for (int i = (len), i_end_ = (1); i >= i_end_; i--) {
      int id = Cir[i + St[x] - 1];
      int val = Max[id][0];
      while (L <= R && Len(S[L].id, i) > t) L++;
      chkmax(dp[id], S[L].val + Len(S[L].id, i) - 1);
      while (L <= R && S[R].val + Len(S[R].id, i) - 1 <= val) R--;
      S[++R] = (Node){i, val};
    }
  }
  for (int i = (St[x]), i_end_ = (Ed[x]); i <= i_end_; i++) {
    int a = Cir[i];
    for (int j = 0; j < (int)G[a].size(); j++) {
      int y = G[a][j].to;
      if (col[a] == col[y]) continue;
      int v = dp[a] + 1;
      if (Mark[y]) continue;
      if (y == pos[a][0])
        chkmax(v, Max[a][1] + 1);
      else
        chkmax(v, Max[a][0] + 1);
      dfs(y, a, v);
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = (1), i_end_ = (m); i <= i_end_; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    G[a].push_back((node){b, i});
    G[b].push_back((node){a, i});
  }
  Tarjan(1, 0);
  bfs();
  dfs(1, 0, 0);
  for (int i = (1), i_end_ = (n); i <= i_end_; i++) {
    printf("%d\n", max(dp[i], Max[i][0]));
  }
  return 0;
}
