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 N = 1000005, M = N * 4;
struct Gragh {
  int cnt, y[M], nxt[M], fst[N];
  void clear() {
    cnt = 1;
    memset(fst, 0, sizeof fst);
  }
  void add(int a, int b) { y[++cnt] = b, nxt[cnt] = fst[a], fst[a] = cnt; }
} g, g2;
int n, m;
int dfn[N], low[N], inst[N], st[N], vis[N], id[N], Time, top, tot;
int used[M];
int Fa[N];
vector<int> cir[N], son[N];
void Tarjan_Prepare() {
  Time = top = tot = 0;
  memset(id, 0, sizeof id);
  memset(st, 0, sizeof st);
  memset(dfn, 0, sizeof dfn);
  memset(low, 0, sizeof low);
  memset(vis, 0, sizeof vis);
  memset(inst, 0, sizeof inst);
  memset(used, 0, sizeof used);
}
void Tarjan(int x) {
  dfn[x] = low[x] = ++Time;
  vis[x] = inst[x] = 1;
  st[++top] = x;
  for (int i = g.fst[x]; i; i = g.nxt[i]) {
    if (used[i / 2]) continue;
    used[i / 2] = 1;
    if (!vis[g.y[i]]) {
      Tarjan(g.y[i]);
      low[x] = min(low[x], low[g.y[i]]);
    } else if (inst[g.y[i]])
      low[x] = min(low[x], low[g.y[i]]);
  }
  if (dfn[x] == low[x]) {
    tot++;
    id[st[top]] = tot;
    inst[st[top]] = 0;
    while (st[top--] != x) {
      id[st[top]] = tot;
      inst[st[top]] = 0;
    }
  }
}
void Get_cir(int x) {
  if (vis[x]) return;
  vis[x] = 1;
  cir[id[x]].push_back(x);
  for (int i = g.fst[x]; i; i = g.nxt[i]) {
    int y = g.y[i];
    if (id[y] == id[x]) Get_cir(y);
  }
}
void build(int x, int pre) {
  int ID = id[x];
  Fa[ID] = pre;
  cir[ID].clear();
  Get_cir(x);
  for (int i = 0; i < cir[ID].size(); i++) {
    int u = cir[ID][i];
    son[u].clear();
    for (int j = g.fst[u]; j; j = g.nxt[j]) {
      int v = g.y[j];
      if (id[v] == ID || id[v] == pre) continue;
      son[u].push_back(v);
      build(v, ID);
    }
  }
}
int Deep[N], spDeep[N], usDeep[N];
int Lmax[N], Rmax[N];
void Get_Deep(int x) {
  int ID = id[x];
  for (int i = 0; i < cir[ID].size(); i++) {
    int u = cir[ID][i], v;
    Deep[u] = 0;
    for (int j = 0; j < son[u].size(); j++) {
      v = son[u][j];
      Get_Deep(v);
      Deep[u] = max(Deep[u], Deep[v] + 1);
    }
  }
  int n = cir[ID].size() - 1;
  Lmax[0] = Rmax[n + 1] = 0;
  for (int i = 1; i <= n; i++) Lmax[i] = max(Lmax[i - 1], Deep[cir[ID][i]] + i);
  for (int i = n; i >= 1; i--)
    Rmax[i] = max(Rmax[i + 1], Deep[cir[ID][i]] + (n - i + 1));
  int v = 1e9;
  for (int i = 1; i <= n + 1; i++) v = min(v, max(Lmax[i - 1], Rmax[i]));
  usDeep[x] = Deep[x];
  Deep[x] = max(Deep[x], spDeep[x] = v);
}
int Far[N];
int val[N * 3];
int Lv[N * 3], Rv[N * 3];
struct Monotone_Queue {
  int head, tail, q[N], d[N];
  void clear() { head = 1, tail = 0; }
  int front() { return head <= tail ? q[head] : 0; }
  void push(int v, int _d) {
    while (head <= tail && q[tail] <= v) tail--;
    q[++tail] = v, d[tail] = _d;
  }
  void pop(int _d) {
    while (head <= tail && d[head] < _d) head++;
  }
  int Next_front(int _d) {
    if (head > tail) return 0;
    if (d[head] != _d) return q[head];
    return head == tail ? 0 : q[head + 1];
  }
  void print() {
    printf("size=%d, sit=:", tail - head + 1);
    for (int i = head; i <= tail; i++) printf("(%d,%d)  ", q[i], d[i]);
    puts("");
  }
} QL, QR;
vector<int> LRmax[N];
void Solve(int x, int far) {
  int ID = id[x];
  Far[x] = far;
  int n = cir[ID].size();
  for (int i = 1; i < n; i++) val[i] = Deep[cir[ID][i]];
  val[0] = max(usDeep[x], Far[x]);
  for (int i = n; i < n * 3; i++) val[i] = val[i % n];
  for (int i = 0; i < n * 3; i++) {
    Lv[i] = val[i] + n * 3 - i;
    Rv[i] = val[i] + i + 1;
  }
  QL.clear(), QR.clear();
  int Lp = 2, Rp = n + 1;
  for (int i = Lp; i <= n; i++) QL.push(Lv[i], i);
  for (int i = n + 1; i < n * 2; i++) {
    int result = 1e9;
    int v1 = n * 3 - i, v2 = i + 1;
    while (Rp < i) {
      Lp++, QL.pop(Lp);
      Rp++;
      if (Rp != i) QR.push(Rv[Rp], Rp);
    }
    while (QL.Next_front(Lp) - v1 >= max(QR.front(), Rv[Rp + 1]) - v2) {
      result = min(result, QL.front() - v1);
      Lp++, QL.pop(Lp);
      Rp++, QR.push(Rv[Rp], Rp);
    }
    result = min(result, QL.front() - v1);
    result = min(result, max(QR.front(), Rv[Rp + 1]) - v2);
    QL.push(Lv[i], i);
    QR.pop(i + 1);
    Far[cir[ID][i % n]] = result;
  }
  for (int i = 0; i < n; i++) {
    int u = cir[ID][i];
    int m = son[u].size();
    Lmax[0] = Rmax[m + 1] = 0;
    for (int j = 1; j <= m; j++)
      Lmax[j] = max(Lmax[j - 1], Deep[son[u][j - 1]] + 1);
    for (int j = m; j >= 1; j--)
      Rmax[j] = max(Rmax[j + 1], Deep[son[u][j - 1]] + 1);
    LRmax[u].clear();
    for (int j = 0; j < m; j++) LRmax[u].push_back(max(Lmax[j], Rmax[j + 2]));
    for (int j = 0; j < m; j++) {
      Solve(son[u][j], max(spDeep[u], max(Far[u], LRmax[u][j])) + 1);
    }
  }
}
int main() {
  scanf("%d%d", &n, &m);
  g.clear();
  for (int i = 1, a, b; i <= m; i++) {
    scanf("%d%d", &a, &b);
    g.add(a, b);
    g.add(b, a);
  }
  Tarjan_Prepare();
  for (int i = 1; i <= n; i++)
    if (!vis[i]) Tarjan(i);
  memset(vis, 0, sizeof vis);
  build(1, 0);
  Get_Deep(1);
  Solve(1, 0);
  for (int i = 1; i <= n; i++) printf("%d ", max(Far[i], Deep[i]));
  return 0;
}
