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(3)
using namespace std;
inline char Sc() {
  static const int LEN = 100000;
  static char Buf[LEN], *OP = Buf, *ED = Buf;
  if (OP == ED) {
    ED = (OP = Buf) + fread(Buf, 1, LEN, stdin);
    if (OP == ED) return -1;
  }
  return *OP++;
}
template <class T>
inline void Rd(T &x) {
  static char c;
  for (x = 0, c = Sc(); c < 48; c = Sc())
    ;
  for (; c > 47; c = Sc()) x = (x << 1) + (x << 3) + (c ^ 48);
}
int n, m;
struct Chart {
  int head[500005];
  Chart() { memset(head, -1, sizeof(head)); }
  struct edge {
    int to, nxt;
    edge(int _to = 0, int _nxt = 0) : to(_to), nxt(_nxt) {}
  } G[1000005 << 1];
  int tol;
  void addedge(int a, int b) {
    G[tol] = edge(b, head[a]);
    head[a] = tol++;
  }
  edge operator[](const int x) { return G[x]; }
} E, G;
int Dfn[500005], Low[500005], T;
int Col[500005], Cres;
int Stk[500005], top;
bool Vis[500005];
vector<int> P[500005];
void Tj(int x, int f) {
  Dfn[x] = Low[x] = ++T;
  Stk[++top] = x;
  Vis[x] = 1;
  for (int i = E.head[x]; ~i; i = E[i].nxt) {
    int y = E[i].to;
    if (y == f) continue;
    if (!~Dfn[y]) {
      Tj(y, x);
      Low[x] = min(Low[x], Low[y]);
    } else if (Vis[y])
      Low[x] = min(Low[x], Dfn[y]);
  }
  if (Low[x] == Dfn[x]) {
    Cres++;
    int y;
    do {
      y = Stk[top--];
      Col[y] = Cres;
      Vis[y] = 0;
      P[Cres].push_back(y);
    } while (x != y);
  }
}
int Q[500005];
bool Visroot[500005];
int Root[500005];
void BFS() {
  int L = 1, R = 1;
  Q[1] = 1;
  Vis[1] = 1;
  while (L <= R) {
    int x = Q[L++];
    if (!Visroot[Col[x]]) Visroot[Col[x]] = 1, Root[Col[x]] = x;
    for (int i = E.head[x]; ~i; i = E[i].nxt) {
      int y = E[i].to;
      if (Vis[y]) continue;
      G.addedge(x, y);
      Vis[y] = 1;
      Q[++R] = y;
    }
  }
}
int SLen[500005][2];
int ULen[500005];
int DLen[500005];
void dfs1(int x) {
  for (int i = G.head[x]; ~i; i = G[i].nxt) {
    int y = G[i].to;
    dfs1(y);
    int mx = SLen[y][0];
    if (mx + 1 > SLen[x][0]) {
      SLen[x][1] = SLen[x][0];
      SLen[x][0] = mx + 1;
    } else if (mx + 1 > SLen[x][1]) {
      SLen[x][1] = mx + 1;
    }
    if (Col[x] != Col[y]) {
      DLen[x] = max(DLen[x], mx + 1);
    }
  }
}
int dp[500005];
int Cir[500005];
int Ans[500005];
void Dp(int x) {
  int root = Root[x];
  int cnt = 0;
  int sz = (int)P[x].size();
  int pos;
  for (int i = (0), i_END_ = (sz - 1); i <= i_END_; ++i)
    if (P[x][i] == root) {
      pos = i;
      break;
    }
  for (int i = (pos), i_END_ = (sz - 1); i <= i_END_; ++i) Cir[++cnt] = P[x][i];
  for (int i = (0), i_END_ = (pos - 1); i <= i_END_; ++i) Cir[++cnt] = P[x][i];
  int L = 1, R = 0;
  int mid = sz / 2;
  Q[++R] = 1;
  dp[1] = max(ULen[root], DLen[root]);
  Ans[root] = ULen[root];
  for (int i = (2), i_END_ = (sz); i <= i_END_; ++i) {
    int id = Cir[i];
    while (L <= R && i - Q[L] > mid) L++;
    dp[i] = DLen[id];
    Ans[id] = dp[Q[L]] + i - Q[L];
    while (L <= R && dp[i] - i >= dp[Q[R]] - Q[R]) R--;
    Q[++R] = i;
  }
  for (int i = (2), i_END_ = (mid); i <= i_END_; ++i) {
    int id = Cir[i];
    while (L <= R && i + sz - Q[L] > mid) L++;
    if (L <= R) Ans[id] = max(Ans[id], dp[Q[L]] + i + sz - Q[L]);
  }
  for (int i = (2), i_END_ = (sz); i <= i_END_; ++i)
    if (sz - i + 2 > i) swap(Cir[i], Cir[sz - i + 2]);
  L = 1;
  R = 0;
  Q[++R] = 1;
  for (int i = (2), i_END_ = (sz); i <= i_END_; ++i) {
    int id = Cir[i];
    while (L <= R && i - Q[L] > mid) L++;
    dp[i] = DLen[id];
    Ans[id] = max(Ans[id], dp[Q[L]] + i - Q[L]);
    while (L <= R && dp[i] - i >= dp[Q[R]] - Q[R]) R--;
    Q[++R] = i;
  }
  for (int i = (2), i_END_ = (mid); i <= i_END_; ++i) {
    int id = Cir[i];
    while (L <= R && i + sz - Q[L] > mid) L++;
    if (L <= R) Ans[id] = max(Ans[id], dp[Q[L]] + i + sz - Q[L]);
  }
}
void dfs2(int x) {
  if (Root[Col[x]] == x) Dp(Col[x]);
  for (int i = G.head[x]; ~i; i = G[i].nxt) {
    int y = G[i].to;
    if (Col[y] != Col[x]) {
      if (SLen[x][0] == SLen[y][0] + 1) {
        ULen[y] = max(Ans[x], SLen[x][1]) + 1;
      } else {
        ULen[y] = max(Ans[x], SLen[x][0]) + 1;
      }
    }
    dfs2(y);
  }
}
void Init() {
  for (int i = (1), i_END_ = (n); i <= i_END_; ++i) Dfn[i] = -1;
  Tj(1, 0);
  BFS();
}
void Solve() {
  dfs1(1);
  dfs2(1);
  for (int i = (1), i_END_ = (n); i <= i_END_; ++i)
    printf("%d\n", max(Ans[i], SLen[i][0]));
}
int main() {
  Rd(n);
  Rd(m);
  int a, b;
  for (int i = (1), i_END_ = (m); i <= i_END_; ++i) {
    Rd(a);
    Rd(b);
    E.addedge(a, b);
    E.addedge(b, a);
  }
  Init();
  Solve();
  return 0;
}
