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;
void Read(int &p) {
  p = 0;
  char c = getchar();
  for (; c < '0' || c > '9'; c = getchar())
    ;
  for (; c >= '0' && c <= '9'; c = getchar()) p = p * 10 + c - '0';
}
struct Node {
  int cnt, tar[2000005], nex[2000005], fir[500005];
  Node() { cnt = 1; }
  void Add(int a, int b) {
    cnt++;
    tar[cnt] = b;
    nex[cnt] = fir[a];
    fir[a] = cnt;
  }
} g, h;
int n, m;
int dfn[500005], low[500005], idx[500005], tim, tot;
int vis[500005], use[2000005], stk[500005], top;
int dep[500005], dep1[500005], dep0[500005], lmx[500005], rmx[500005];
int dis[500005], val[500005 << 2], lvl[500005 << 2], rvl[500005 << 2];
vector<int> cir[500005], son[500005], V[500005];
void Tarjan(int x) {
  dfn[x] = low[x] = ++tim;
  vis[x] = 1;
  stk[++top] = x;
  for (int i = g.fir[x]; i; i = g.nex[i]) {
    if (use[i / 2]) continue;
    use[i / 2] = 1;
    int v = g.tar[i];
    if (!vis[v]) {
      Tarjan(v);
      low[x] = min(low[x], low[v]);
    } else if (!idx[v])
      low[x] = min(low[x], low[v]);
  }
  if (dfn[x] == low[x]) {
    tot++;
    do {
      idx[stk[top]] = tot;
    } while (stk[top--] != x);
  }
}
void Getloop(int x) {
  if (vis[x]) return;
  vis[x] = 1;
  cir[idx[x]].push_back(x);
  for (int i = g.fir[x]; i; i = g.nex[i]) {
    int v = g.tar[i];
    if (idx[v] == idx[x]) Getloop(v);
  }
}
void Build(int x, int f) {
  int w = idx[x];
  cir[w].clear();
  Getloop(x);
  for (int i = 0; i < (int)cir[w].size(); i++) {
    int u = cir[w][i];
    son[u].clear();
    for (int j = g.fir[u]; j; j = g.nex[j]) {
      int v = g.tar[j];
      if (idx[v] == w || idx[v] == f) continue;
      son[u].push_back(v);
      Build(v, w);
    }
  }
}
void Getdepth(int x) {
  int w = idx[x];
  for (int i = 0; i < (int)cir[w].size(); i++) {
    int u = cir[w][i];
    dep[u] = 0;
    for (int j = 0; j < (int)son[u].size(); j++) {
      int v = son[u][j];
      Getdepth(v);
      dep[u] = max(dep[u], dep[v] + 1);
    }
  }
  int n = cir[w].size() - 1;
  lmx[0] = rmx[n + 1] = 0;
  for (int i = 1; i <= n; i++) lmx[i] = max(lmx[i - 1], dep[cir[w][i]] + i);
  for (int i = n; i >= 1; i--)
    rmx[i] = max(rmx[i + 1], dep[cir[w][i]] + (n - i + 1));
  w = 0x3f3f3f3f;
  for (int i = 1; i <= n + 1; i++) w = min(w, max(lmx[i - 1], rmx[i]));
  dep0[x] = dep[x], dep1[x] = w;
  dep[x] = max(dep0[x], dep1[x]);
}
struct Queue {
  int hd, tl, q[500005 << 2], d[500005 << 2];
  void Init() { hd = 1, tl = 0; }
  int Fro() { return hd <= tl ? q[hd] : -0x3f3f3f3f; }
  int Nex(int w) {
    if (hd > tl) return -0x3f3f3f3f;
    if (d[hd] != w) return q[hd];
    return hd == tl ? -0x3f3f3f3f : q[hd + 1];
  }
  void Push(int v, int w) {
    while (hd <= tl && q[tl] <= v) tl--;
    tl++;
    q[tl] = v, d[tl] = w;
  }
  void Pop(int w) {
    while (hd <= tl && d[hd] < w) hd++;
  }
} Q1, Q2;
void Solve(int x, int d) {
  int w = idx[x];
  dis[x] = d;
  int n = cir[w].size();
  for (int i = 1; i < n; i++) val[i] = dep[cir[w][i]];
  val[0] = max(dep0[x], dis[x]);
  for (int i = n; i < n * 3; i++) val[i] = val[i % n];
  for (int i = 0; i < n * 3; i++) {
    lvl[i] = val[i] + n * 3 - i;
    rvl[i] = val[i] + i + 1;
  }
  Q1.Init(), Q2.Init();
  int lp = 2, rp = n + 1;
  for (int i = lp; i <= n; i++) Q1.Push(lvl[i], i);
  for (int i = n + 1; i < n * 2; i++) {
    int res = 0x3f3f3f3f;
    int v1 = n * 3 - i, v2 = i + 1;
    while (rp < i) {
      Q1.Pop(++lp);
      rp++;
      if (rp != i) Q2.Push(rvl[rp], rp);
    }
    while (Q1.Nex(lp) - v1 > max(Q2.Fro(), rvl[rp + 1]) - v2) {
      res = min(res, Q1.Fro() - v1);
      Q1.Pop(++lp);
      rp++, Q2.Push(rvl[rp], rp);
    }
    res = min(res, Q1.Fro() - v1);
    res = min(res, max(Q2.Fro(), rvl[rp + 1]) - v2);
    Q1.Push(lvl[i], i);
    Q2.Pop(i + 2);
    dis[cir[w][i % n]] = res;
  }
  for (int i = 0; i < n; i++) {
    int u = cir[w][i];
    int m = son[u].size();
    lmx[0] = rmx[m + 1] = 0;
    for (int j = 1; j <= m; j++)
      lmx[j] = max(lmx[j - 1], dep[son[u][j - 1]] + 1);
    for (int j = m; j >= 1; j--)
      rmx[j] = max(rmx[j + 1], dep[son[u][j - 1]] + 1);
    V[u].clear();
    for (int j = 0; j < m; j++) V[u].push_back(max(lmx[j], rmx[j + 2]));
    for (int j = 0; j < m; j++)
      Solve(son[u][j], max(dep1[u], max(dis[u], V[u][j])) + 1);
  }
}
int main() {
  Read(n), Read(m);
  for (int i = 1; i <= m; i++) {
    int a, b;
    Read(a), Read(b);
    g.Add(a, b), g.Add(b, a);
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) Tarjan(i);
  memset(vis, 0, sizeof vis);
  Build(1, 0);
  Getdepth(1);
  Solve(1, 0);
  for (int i = 1; i <= n; i++)
    printf("%d%c", max(dis[i], dep[i]), i == n ? 10 : 32);
}
