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 = 2 * (1e9) + 10;
const long long MOD = 1000000009;
const int NMAX = 1000005;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
vector<int> G[NMAX];
int cycln = 0;
vector<int> Gcycl[NMAX];
int dpin[NMAX];
int dpout[NMAX];
int dpout2[NMAX];
bool viz[NMAX];
int cviz[NMAX];
int cind[NMAX];
bool incv[NMAX];
struct MaxDeque {
  vector<pair<int, int>> q;
  int ql, qr, indl, indr;
  MaxDeque() {
    ql = indl = indr = 0;
    qr = -1;
  }
  void push(int val) {
    while (ql <= qr && q[qr].second < val) qr--;
    ++qr;
    pair<int, int> newp = {++indr, val};
    if (qr >= q.size())
      q.push_back(newp);
    else
      q[qr] = newp;
  }
  void pop() {
    indl++;
    while (ql <= qr && q[ql].first <= indl) ql++;
  }
  int tail() { return q[ql].second; }
};
stack<int> hst;
void dfs1(int v, int p) {
  hst.push(v);
  for (auto el : G[v]) {
    if (el == p) {
      continue;
    }
    if (viz[el] && !cind[el]) {
      cycln++;
      while (!hst.empty() && hst.top() != el) {
        Gcycl[cycln].push_back(hst.top());
        hst.pop();
      }
      reverse(Gcycl[cycln].begin(), Gcycl[cycln].end());
      for (auto el : Gcycl[cycln]) hst.push(el);
      Gcycl[cycln].push_back(el);
      incv[el] = 1;
      reverse(Gcycl[cycln].begin(), Gcycl[cycln].end());
      Gcycl[cycln].push_back(el);
      for (auto cc : Gcycl[cycln]) {
        cind[cc] = cycln;
      }
    }
    if (!viz[el]) {
      viz[el] = 1;
      dfs1(el, v);
    }
  }
  hst.pop();
}
void dfs2(int v, int p1, int p2, int p3) {
  if (cind[v] && !cviz[cind[v]]) {
    cviz[cind[v]] = 1;
    int ci = cind[v];
    multiset<int> hsh;
    int cn = Gcycl[ci].size() - 1;
    dfs2(Gcycl[ci][0], Gcycl[ci][1], Gcycl[ci][cn - 1], p1);
    for (int i = 1; i < cn; ++i) {
      int el = Gcycl[ci][i];
      dfs2(Gcycl[ci][i], Gcycl[ci][i - 1], Gcycl[ci][i + 1], 0);
      hsh.insert(i + dpin[el]);
    }
    int mn = *(hsh.rbegin());
    for (int i = cn - 1; i >= 1; --i) {
      int el = Gcycl[ci][i];
      hsh.erase(hsh.find(i + dpin[el]));
      hsh.insert(cn - i + dpin[el]);
      mn = min(mn, *(hsh.rbegin()));
    }
    dpin[v] = max(mn, dpin[v]);
  } else {
    for (auto el : G[v]) {
      if (el == p1 || el == p2 || el == p3) {
        continue;
      }
      dfs2(el, v, 0, 0);
      if (incv[v])
        dpout2[v] = max(dpout2[v], max(dpin[el], dpout2[el]) + 1);
      else
        dpin[v] = max(dpin[v], max(dpin[el], dpout2[el]) + 1);
    }
  }
}
int lst[NMAX];
void dfs3(int v, int p1, int p2, int p3) {
  if (cind[v] && !cviz[cind[v]]) {
    cviz[cind[v]] = 1;
    MaxDeque Qa, Qb;
    int ci = cind[v];
    int cn = Gcycl[ci].size() - 1;
    for (int i = 0; i < cn; ++i) {
      int el = Gcycl[ci][i];
      int val;
      if (el == v)
        val = max(dpout[el], dpout2[el]);
      else
        val = dpin[el];
      lst[i] = val;
      lst[i + cn] = val;
    }
    int hlf = cn / 2;
    int ra = 0, rb = 0, la = 0, lb = 0;
    for (int i = 1; i < cn; ++i) {
      int el = Gcycl[ci][i];
      while (ra <= i + hlf) Qa.push(ra + lst[ra]), ra++;
      while (la <= i) Qa.pop(), la++;
      while (rb <= i + cn - 1) Qb.push((cn - rb) + lst[rb]), rb++;
      while (lb <= i + hlf) Qb.pop(), lb++;
      int qat = Qa.tail();
      int qbt = Qb.tail();
      int qatc = Qa.tail() - i;
      int qbtc = Qb.tail() + i;
      dpout[Gcycl[ci][i]] = max(Qa.tail() - i, Qb.tail() + i);
    }
    for (int i = 1; i < cn; ++i) {
      dfs3(Gcycl[ci][i], Gcycl[ci][i - 1], Gcycl[ci][i + 1], 0);
    }
    dpout[Gcycl[ci][0]] = max(dpout[Gcycl[ci][0]], dpin[Gcycl[ci][0]]);
    dfs3(Gcycl[ci][0], Gcycl[ci][1], Gcycl[ci][cn - 1], p1);
  } else {
    multiset<int> hsh;
    for (auto el : G[v]) {
      if (el == p1 || el == p2 || el == p3) continue;
      hsh.insert(max(dpin[el], dpout2[el]));
    }
    for (auto el : G[v]) {
      if (el == p1 || el == p2 || el == p3) continue;
      hsh.erase(hsh.find(max(dpin[el], dpout2[el])));
      dpout[el] = dpout[v] + 1;
      if (!hsh.empty()) dpout[el] = max(dpout[el], *(hsh.rbegin()) + 2);
      dfs3(el, v, 0, 0);
      hsh.insert(max(dpin[el], dpout2[el]));
    }
  }
}
int n, m;
int main() {
  cin >> n >> m;
  for (int i = 1; i <= m; ++i) {
    int a, b;
    cin >> a >> b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  viz[1] = 1;
  dfs1(1, 0);
  memset(cviz, 0, sizeof(cviz));
  dfs2(1, 0, 0, 0);
  memset(cviz, 0, sizeof(cviz));
  dfs3(1, 0, 0, 0);
  for (int i = 1; i <= n; ++i) {
    cout << max(dpout[i], max(dpin[i], dpout2[i])) << " ";
  }
  cout << "\n";
  return 0;
}
