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;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 500000;
int n, m;
vector<int> adj[MAXN];
int par[MAXN];
int state[MAXN];
int comp[MAXN];
vector<int> cyc[MAXN];
void dfsinit(int at) {
  state[at] = 1;
  for (int i = (0); i < (((int)(adj[at]).size())); ++i) {
    int to = adj[at][i];
    if (to == par[at]) continue;
    if (state[to] == 0) {
      par[to] = at;
      dfsinit(to);
    } else if (state[to] == 1) {
      for (int x = at; x != to; x = par[x]) cyc[to].push_back(x);
      cyc[to].push_back(to);
      reverse(cyc[to].begin(), cyc[to].end());
      for (int j = (0); j < (((int)(cyc[to]).size())); ++j)
        assert(comp[cyc[to][j]] == -1);
      for (int j = (0); j < (((int)(cyc[to]).size())); ++j)
        comp[cyc[to][j]] = to;
    } else {
      assert(state[to] == 2 && comp[to] == comp[at]);
    }
  }
  state[at] = 2;
}
int dpdown[MAXN], downvia[MAXN], dpdown2[MAXN];
int dpup[MAXN];
int tmp[2 * MAXN];
void upddown(int at, int val, int via) {
  if (val > dpdown[at])
    dpdown2[at] = dpdown[at], dpdown[at] = val, downvia[at] = via;
  else if (val > dpdown2[at])
    dpdown2[at] = val;
}
void dfsdown(int at) {
  dpdown[at] = 0, downvia[at] = -1, dpdown2[at] = 0;
  for (int i = (0); i < (((int)(adj[at]).size())); ++i) {
    int to = adj[at][i];
    if (to == par[at] || (comp[at] != -1 && comp[at] == comp[to])) continue;
    dfsdown(to);
    upddown(at, dpdown[to] + 1, to);
  }
  if (comp[at] != -1 && at == comp[at]) {
    assert(comp[at] == at && ((int)(cyc[at]).size()) > 0 && cyc[at][0] == at);
    for (int i = (1); i < (((int)(cyc[at]).size())); ++i) {
      int to = cyc[at][i];
      dfsdown(to);
    }
    for (int i = (1); i < (((int)(cyc[at]).size())); ++i) {
      int to = cyc[at][i];
      tmp[i] = dpdown[to];
    }
    int cycdown = 0;
    for (int i = (1); i < (((int)(cyc[at]).size())); ++i)
      cycdown = max(cycdown, tmp[i] + min(i, ((int)(cyc[at]).size()) - i));
    upddown(at, cycdown, -2);
  }
}
struct MxQ {
  int lidx, ridx;
  char id;
  pair<int, int> q[2 * MAXN];
  int qtail, qhead;
  void clear() { lidx = ridx = qtail = qhead = 0; }
  void push(int val) {
    while (qtail < qhead && q[qhead - 1].second < val) --qhead;
    q[qhead++] = make_pair(ridx, val);
    ++ridx;
  }
  void pop() {
    ++lidx;
    while (qtail < qhead && q[qtail].first < lidx) ++qtail;
  }
  int get(int off) { return qtail < qhead ? q[qtail].second + off : INT_MIN; }
};
MxQ qa, qb;
void dfsup(int at) {
  dpup[at] = 0;
  if (par[at] != -1) {
    dpup[at] = max(dpup[at], 1 + dpup[par[at]]);
    dpup[at] = max(dpup[at], 1 + (downvia[par[at]] != at ? dpdown[par[at]]
                                                         : dpdown2[par[at]]));
  }
  for (int i = (0); i < (((int)(adj[at]).size())); ++i) {
    int to = adj[at][i];
    if (to == par[at] || (comp[at] != -1 && comp[at] == comp[to])) continue;
    dfsup(to);
  }
  if (comp[at] != -1) {
    assert(comp[at] == at && ((int)(cyc[at]).size()) > 0 && cyc[at][0] == at);
    for (int i = (0); i < (((int)(cyc[at]).size())); ++i) {
      tmp[i] = 0;
      int u = cyc[at][i];
      for (int j = (0); j < (((int)(adj[u]).size())); ++j) {
        int to = adj[u][j];
        if (to == par[at])
          tmp[i] = max(tmp[i], dpup[at]);
        else if (comp[to] != at)
          tmp[i] = max(tmp[i], 1 + dpdown[to]);
      }
    }
    for (int i = (0); i < (((int)(cyc[at]).size())); ++i)
      tmp[i + ((int)(cyc[at]).size())] = tmp[i];
    qa.id = 'A';
    qb.id = 'B';
    qa.clear();
    qb.clear();
    int lsa = 0, hsa = 0, lsb = 0, hsb = 0;
    for (int i = (1); i < (((int)(cyc[at]).size())); ++i) {
      int u = cyc[at][i];
      while (i + ((int)(cyc[at]).size()) / 2 >= hsa)
        qa.push(tmp[hsa] + hsa), ++hsa;
      while (lsa <= i) qa.pop(), ++lsa;
      while (i + ((int)(cyc[at]).size()) - 1 >= hsb)
        qb.push(tmp[hsb] + ((int)(cyc[at]).size()) - hsb), ++hsb;
      while (lsb <= i + ((int)(cyc[at]).size()) / 2) qb.pop(), ++lsb;
      dpup[u] = max(qa.get(-i), qb.get(+i));
    }
    for (int i = (1); i < (((int)(cyc[at]).size())); ++i) {
      int u = cyc[at][i];
      for (int j = (0); j < (((int)(adj[u]).size())); ++j) {
        int to = adj[u][j];
        if (to != par[at] && comp[to] != at) dfsup(to);
      }
    }
  }
}
int ans[MAXN];
void run() {
  scanf("%d%d", &n, &m);
  for (int i = (0); i < (m); ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    --a, --b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for (int i = (0); i < (n); ++i) par[i] = -1, comp[i] = -1, state[i] = 0;
  dfsinit(0);
  dfsdown(0);
  dfsup(0);
  for (int at = (0); at < (n); ++at) {
    ans[at] = 0;
    ans[at] = max(ans[at], dpup[at]);
    if (comp[at] != -1 && at == comp[at]) ans[at] = max(ans[at], dpdown[at]);
    for (int i = (0); i < (((int)(adj[at]).size())); ++i) {
      int to = adj[at][i];
      if (to != par[at] && (comp[at] == -1 || comp[to] != comp[at]))
        ans[at] = max(ans[at], 1 + dpdown[to]);
    }
  }
  for (int i = (0); i < (n); ++i) {
    if (i != 0) printf(" ");
    printf("%d", ans[i]);
  }
  puts("");
}
int main() {
  run();
  return 0;
}
