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;
int read() {
  int x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + ch - '0';
    ch = getchar();
  }
  return x;
}
int MAX(int x, int y) { return x > y ? x : y; }
int MIN(int x, int y) { return x < y ? x : y; }
int n, m;
int cnt;
class Queue {
 private:
  int head, tail, a[1000010], num[1000010];

 public:
  void push(int x, int id) {
    while (head <= tail && x > a[tail]) tail--;
    tail++;
    a[tail] = x;
    num[tail] = id;
  }
  void pop(int id, int len) {
    int x = id - len;
    while (head <= tail && num[head] < x) head++;
  }
  int top() { return a[head]; }
  void clear() {
    head = 1;
    tail = 0;
  }
  bool empty() { return head > tail; }
} q;
class Stack {
 private:
  int tail, a[1000010];

 public:
  void push(int x) { a[tail++] = x; }
  void pop() { tail--; }
  int top() { return a[tail - 1]; }
  void clear() { tail = 0; }
  bool empty() { return tail == 0; }
} s;
class Tree {
 private:
  int head[1000010 << 2], next[1000010 << 2], ver[1000010 << 2], tot;
  bool bo[1000010];
  int l[1000010], g[1000010], fir[1000010], sec[1000010], firfrom[1000010];
  int num[1000010], dp[1000010];
  void DP(int u, int pre) {
    g[u]--;
    int id = 0, v, len = l[u] / 2;
    q.clear();
    for (int j = 0; j < 2; j++)
      for (int i = head[u]; i; i = next[i]) {
        num[++id] = v = ver[i];
        if (v == pre)
          dp[id] = g[u];
        else
          dp[id] = fir[v];
        q.pop(id, len);
        if (v != pre && !q.empty()) g[v] = MAX(g[v], id + q.top());
        q.push(dp[id] - id, id);
      }
    q.clear();
    for (int i = id; i; i--) {
      q.pop(-i, len);
      if (num[i] != pre && !q.empty()) g[num[i]] = MAX(g[num[i]], q.top() - i);
      q.push(dp[i] + i, -i);
    }
  }

 public:
  void set_square(int x) { bo[x] = true; }
  void add(int x, int y) {
    ver[++tot] = y;
    next[tot] = head[x];
    head[x] = tot;
    ver[++tot] = x;
    next[tot] = head[y];
    head[y] = tot;
    l[x]++;
    l[y]++;
  }
  void dfs1(int u, int pre) {
    for (int i = head[u], v; i; i = next[i]) {
      v = ver[i];
      if (v == pre) continue;
      dfs1(v, u);
      if (bo[u]) continue;
      if (fir[v] + 1 > fir[u]) {
        sec[u] = fir[u];
        fir[u] = fir[v] + 1;
        firfrom[u] = v;
      } else if (fir[v] + 1 > sec[u])
        sec[u] = fir[v] + 1;
    }
    if (bo[u]) {
      int sum = 0;
      for (int i = head[u], v; i; i = next[i]) {
        v = ver[i];
        sum++;
        if (v == pre) continue;
        fir[u] = MAX(fir[u], fir[v] + MIN(l[u] - sum, sum));
      }
      fir[u]--;
    }
  }
  void dfs2(int u, int pre) {
    if (bo[u]) DP(u, pre);
    for (int i = head[u], v; i; i = next[i]) {
      v = ver[i];
      if (v == pre) continue;
      if (!bo[u]) {
        g[v] = MAX(g[v], g[u] + 1);
        if (firfrom[u] == v)
          g[v] = MAX(g[v], sec[u] + 1);
        else
          g[v] = MAX(g[v], fir[u] + 1);
      }
      dfs2(v, u);
    }
    g[u] = MAX(fir[u], g[u]);
  }
  void PrintAns() {
    for (int i = 1; i <= n; i++) printf("%d ", g[i]);
  }
} T;
class Cactus {
 private:
  int head[1000010 << 2], next[1000010 << 2], ver[1000010 << 2], tot;
  int dfn[1000010], low[1000010], tim;

 public:
  Cactus() { tim = 0; }
  void add(int x, int y) {
    ver[++tot] = y;
    next[tot] = head[x];
    head[x] = tot;
    ver[++tot] = x;
    next[tot] = head[y];
    head[y] = tot;
  }
  void Tarjan(int u, int pre) {
    dfn[u] = low[u] = ++tim;
    for (int i = head[u], v; i; i = next[i]) {
      v = ver[i];
      if (v == pre) continue;
      if (!dfn[v]) {
        s.push(i);
        Tarjan(v, u);
        if (low[v] > dfn[u]) {
          T.add(v, u);
          s.pop();
        }
        if (low[v] == dfn[u]) {
          T.set_square(++cnt);
          while (!s.empty() && s.top() != i) {
            T.add(cnt, ver[s.top()]);
            s.pop();
          }
          T.add(cnt, ver[s.top()]);
          s.pop();
        }
        low[u] = MIN(low[u], low[v]);
      } else if (dfn[v] < low[u]) {
        s.push(i);
        low[u] = dfn[v];
      }
    }
  }
} C;
int main() {
  s.clear();
  q.clear();
  n = read();
  m = read();
  for (int i = 1; i <= m; i++) C.add(read(), read());
  cnt = n;
  C.Tarjan(1, 0);
  T.dfs1(1, 0);
  T.dfs2(1, 0);
  T.PrintAns();
  return 0;
}
