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 INF = 0x3f3f3f3f;
const int mo = 998244353;
const int inv2 = 499122177;
const int jzm = 2333;
const int orG = 3, invG = 332748118;
const int lim = 300000;
const double Pi = acos(-1.0);
const double PI = acos(-1.0);
template <typename _T>
_T Fabs(_T x) {
  return x < 0 ? -x : x;
}
template <typename _T>
void read(_T &x) {
  _T f = 1;
  x = 0;
  char s = getchar();
  while (s > '9' || s < '0') {
    if (s == '-') f = -1;
    s = getchar();
  }
  while ('0' <= s && s <= '9') {
    x = (x << 3) + (x << 1) + (s ^ 48);
    s = getchar();
  }
  x *= f;
}
template <typename _T>
void print(_T x) {
  if (x < 0) {
    x = (~x) + 1;
    putchar('-');
  }
  if (x > 9) print(x / 10);
  putchar(x % 10 + '0');
}
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
int add(int x, int y) { return x + y < mo ? x + y : x + y - mo; }
int qkpow(int a, int s) {
  int t = 1;
  while (s) {
    if (s & 1) t = 1ll * a * t % mo;
    a = 1ll * a * a % mo;
    s >>= 1;
  }
  return t;
}
int n, m, head[500005], tot, dp[500005], g[500005], dfn[500005], low[500005],
    belong[500005];
int sta[500005], stak, deg[500005], idx, cnt, q[2][500005 << 1], Head[2],
    Tail[2], ans[500005];
int dis[500005], ord[500005], tid, mxd[500005];
bool vis[500005];
vector<int> cir[500005];
queue<int> Q;
struct edge {
  int to, nxt;
} e[500005 << 1];
void addEdge(int u, int v) {
  e[++tot] = (edge){v, head[u]};
  head[u] = tot;
}
void bfs(int s) {
  while (!Q.empty()) Q.pop();
  Q.push(s);
  dis[s] = 1;
  vis[s] = 1;
  while (!Q.empty()) {
    int t = Q.front();
    Q.pop();
    ord[++tid] = t;
    for (int i = head[t]; i; i = e[i].nxt) {
      int v = e[i].to;
      if (vis[v]) continue;
      Q.push(v);
      vis[v] = 1;
      dis[v] = dis[t] + 1;
    }
  }
  for (int i = tid; i > 0; i--) {
    int u = ord[i];
    mxd[u] = dis[u];
    for (int j = head[u]; j; j = e[j].nxt) mxd[u] = max(mxd[e[j].to], mxd[u]);
    dp[u] = mxd[u] - dis[u] + 1;
  }
}
void tarjan(int u, int fa) {
  dfn[u] = low[u] = ++idx;
  sta[++stak] = u;
  for (int i = head[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (!dfn[v])
      tarjan(v, u), low[u] = min(low[u], low[v]);
    else if (v != fa)
      low[u] = min(low[u], dfn[v]);
  }
  if (low[u] == dfn[u]) {
    ++cnt;
    int v;
    do {
      v = sta[stak--];
      belong[v] = cnt;
    } while (v != u);
  }
}
void dosaka(int u, int fa) {
  int id = belong[u], siz = cir[id].size();
  Head[0] = Tail[0] = Head[1] = Tail[1] = 1;
  for (int i = 0; i < siz; i++) {
    g[i] = 1;
    for (int j = head[cir[id][i]]; j; j = e[j].nxt)
      if (belong[e[j].to] != id) g[i] = max(dp[e[j].to] + 1, g[i]);
  }
  for (int i = 1; i + i <= siz; i++) {
    while (Head[0] < Tail[0] &&
           g[i] + i >= g[q[0][Tail[0] - 1]] + q[0][Tail[0] - 1])
      Tail[0]--;
    q[0][Tail[0]++] = i;
  }
  for (int i = (siz + 1) / 2; i < siz; i++) {
    while (Head[1] < Tail[1] &&
           g[i] - i >= g[q[1][Tail[1] - 1]] - q[1][Tail[1] - 1])
      Tail[1]--;
    q[1][Tail[1]++] = i;
  }
  if (Head[0] < Tail[0]) ans[u] = max(ans[u], g[q[0][Head[0]]] + q[0][Head[0]]);
  if (Head[1] < Tail[1])
    ans[u] = max(ans[u], g[q[1][Head[1]]] + siz - q[1][Head[1]]);
  for (int i = 1; i < siz; i++) {
    int stp = cir[id][i], las = i - 1,
        lst = (i + (siz + 1) / 2 - 1 + siz) % siz;
    while (Head[1] < Tail[1] && q[1][Head[1]] == lst) Head[1]++;
    while (Head[0] < Tail[0] && q[0][Head[0]] == i) Head[0]++;
    while (Head[1] < Tail[1] &&
           g[q[1][Tail[1] - 1]] + (i + siz - q[1][Tail[1] - 1]) % siz <=
               g[las] + (i + siz - las) % siz)
      Tail[1]--;
    q[1][Tail[1]++] = las;
    while (Head[0] < Tail[0] &&
           g[q[0][Tail[0] - 1]] + (q[0][Tail[0] - 1] + siz - i) % siz <=
               g[lst] + (lst + siz - i) % siz)
      Tail[0]--;
    q[0][Tail[0]++] = lst;
    if (Head[0] < Tail[0])
      ans[stp] =
          max(ans[stp], g[q[0][Head[0]]] + (q[0][Head[0]] - i + siz) % siz);
    if (Head[1] < Tail[1])
      ans[stp] =
          max(ans[stp], g[q[1][Head[1]]] + (i + siz - q[1][Head[1]]) % siz);
  }
  for (int i = 0; i < siz; i++) {
    u = cir[id][i];
    int f1 = 1, f2 = 1;
    for (int j = head[u]; j; j = e[j].nxt) {
      int v = e[j].to;
      if (belong[v] == id) continue;
      if (dp[v] + 1 > f1)
        f2 = f1, f1 = dp[v] + 1;
      else if (dp[v] + 1 > f2)
        f2 = dp[v] + 1;
    }
    f1 = max(ans[u], f1);
    f2 = max(ans[u], f2);
    ans[u] = max(g[i], ans[u]);
    for (int j = head[u]; j; j = e[j].nxt) {
      int v = e[j].to;
      if (belong[v] == id || v == fa) continue;
      int tmpu = dp[u];
      if (dp[v] + 1 == f1)
        dp[u] = f2;
      else
        dp[u] = f1;
      dosaka(v, u);
      dp[u] = tmpu;
    }
  }
}
bool cmp(int x, int y) { return dfn[x] < dfn[y]; }
signed main() {
  read(n);
  read(m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    read(u);
    read(v);
    deg[u]++;
    deg[v]++;
    addEdge(u, v);
    addEdge(v, u);
  }
  bfs(1);
  for (int i = 1; i <= n; i++)
    if (!dfn[i]) tarjan(i, 0);
  for (int i = 1; i <= n; i++) cir[belong[i]].push_back(i);
  for (int i = 1; i <= cnt; i++) sort(cir[i].begin(), cir[i].end(), cmp);
  dosaka(1, 0);
  for (int i = 1; i <= n; i++) printf("%d ", ans[i] - 1);
  puts("");
  return 0;
}
