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;
inline long long read() {
  long long x = 0;
  bool f = 1;
  char s = getchar();
  while ((s < '0' || s > '9') && s > 0) {
    if (s == '-') f ^= 1;
    s = getchar();
  }
  while (s >= '0' && s <= '9') x = (x << 1) + (x << 3) + s - '0', s = getchar();
  return f ? x : -x;
}
int n, m, ans[500005];
int IN, dfn[500005], low[500005], bl[500005], tot;
stack<int> st;
int d1[500005], sd[500005], d2[500005], ccg[500005];
vector<int> G[500005], cl[500005];
inline void dfs0(int x, int fa) {
  dfn[x] = low[x] = ++IN, st.push(x);
  for (unsigned i = 0; i < G[x].size(); i++) {
    int v = G[x][i];
    if (v == fa) continue;
    if (!dfn[v])
      dfs0(v, x), low[x] = min(low[x], low[v]);
    else
      low[x] = min(low[x], dfn[v]);
  }
  if (low[x] == dfn[x]) {
    tot++;
    while (!st.empty() && dfn[st.top()] >= dfn[x])
      bl[st.top()] = tot, cl[tot].push_back(st.top()), st.pop();
  }
}
queue<int> q;
int db[500005];
inline void bfs1(int x) {
  for (int i = 1; i <= n; i++) db[i] = -1;
  db[x] = 0, q.push(x);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (unsigned i = 0; i < G[u].size(); i++) {
      int v = G[u][i];
      if (db[v] < 0) db[v] = db[u] + 1, q.push(v);
    }
  }
}
inline void dfs1(int x) {
  d1[x] = 1;
  for (unsigned i = 0; i < G[x].size(); i++) {
    int v = G[x][i];
    if (db[v] == db[x] + 1) dfs1(v), d1[x] = max(d1[x], d1[v] + 1);
  }
}
struct node {
  int x, y;
  node() {}
  node(int X, int Y) { x = X, y = Y; }
};
int dq[500005 << 1], hd, tl;
bool vis[500005];
inline void dfs2(int x) {
  vis[x] = 1;
  int len = cl[x].size(), cj = len >> 1;
  for (int id = 0; id < len; id++) {
    int u = cl[x][id];
    sd[u] = ans[u] = 1;
    for (unsigned i = 0; i < G[u].size(); i++) {
      int v = G[u][i];
      if (bl[u] != bl[v]) sd[u] = max(sd[u], d1[v] + 1);
    }
  }
  hd = tl = 0;
  for (int i = cj, lim = len << 1; i < lim; i++) {
    int u = cl[x][i % len], p;
    while (hd < tl && i - dq[hd] > cj) hd++;
    if (hd < tl) p = dq[hd], ans[u] = max(ans[u], i - p + sd[cl[x][p % len]]);
    while (hd < tl && ((p = dq[tl - 1]) || 1) &&
           i - p + sd[cl[x][p % len]] < sd[u])
      tl--;
    dq[tl++] = i;
  }
  hd = tl = 0;
  for (int i = cj, g = (len << 1) - 1; i <= g; i++) {
    int u = cl[x][(g - i) % len], p;
    while (hd < tl && i - dq[hd] > cj) hd++;
    if (hd < tl)
      p = dq[hd], ans[u] = max(ans[u], i - p + sd[cl[x][(g - p) % len]]);
    while (hd < tl && ((p = dq[tl - 1]) || 1) &&
           i - p + sd[cl[x][(g - p) % len]] < sd[u])
      tl--;
    dq[tl++] = i;
  }
  for (int id = 0; id < len; id++) {
    int u = cl[x][id];
    hd = tl = 0;
    for (unsigned i = 0; i < G[u].size(); i++)
      if (bl[G[u][i]] != x) {
        int v = G[u][i];
        while (hd < tl && d1[dq[tl - 1]] < d1[v]) tl--;
        dq[tl++] = v;
      }
    for (unsigned i = 0; i < G[u].size(); i++)
      if (bl[G[u][i]] != x) {
        int v = G[u][i], cg = ans[u];
        if (hd < tl && dq[hd] == v) hd++;
        if (hd < tl) cg = max(cg, d1[dq[hd]] + 1);
        while (hd < tl && d1[dq[tl - 1]] < d1[v]) tl--;
        dq[tl++] = v;
        if (!vis[bl[v]]) ccg[v] = cg;
      }
    for (unsigned i = 0; i < G[u].size(); i++)
      if (bl[G[u][i]] != x) {
        int v = G[u][i];
        if (!vis[bl[v]]) swap(d1[u], ccg[v]), dfs2(bl[v]), swap(d1[u], ccg[v]);
      }
  }
}
signed main() {
  n = read(), m = read();
  for (int i = 1; i <= m; i++) {
    int u = read(), v = read();
    G[u].push_back(v), G[v].push_back(u);
  }
  dfs0(1, 0);
  bfs1(1);
  if (n <= 10000) dfs1(1);
  if (n <= 10000) dfs2(bl[1]);
  for (int i = 1; i <= n; i++) printf("%d ", max(ans[i], sd[i]) - 1);
  return 0;
}
