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 = 5e5 + 5;
vector<int> edges[N];
vector<pair<int, pair<int, int>>> edges_scc[N];
vector<int> cnt_scc1[N];
vector<int> cnt_scc2[N];
vector<int> cnt_cyc[N];
stack<int> st;
int dfn[N];
int low[N];
int scc_len[N];
pair<int, int> scc[N];
int scc_cnt = 0;
int T = 1;
int tarjan(int s, int p) {
  st.push(s);
  dfn[s] = T;
  low[s] = T++;
  for (int next : edges[s]) {
    if (next == p)
      ;
    else if (dfn[next])
      low[s] = min(low[s], dfn[next]);
    else
      low[s] = min(low[s], tarjan(next, s));
  }
  if (low[s] == dfn[s]) {
    scc_cnt++;
    int idx = 0;
    while (!st.empty()) {
      int top = st.top();
      st.pop();
      scc[top] = {scc_cnt, ++idx};
      if (top == s) break;
    }
    scc_len[scc_cnt] = idx;
  }
  return low[s];
}
void add_edges_of_scc(int n) {
  for (int i = 1; i <= n; i += 1) {
    for (int next : edges[i]) {
      if (scc[i].first != scc[next].first) {
        edges_scc[scc[i].first].push_back(
            {scc[next].first, {scc[i].second, scc[next].second}});
      }
    }
  }
}
int dfs_scc(int ss, int sid, int sp) {
  cnt_scc1[ss].assign(scc_len[ss] + 1, 0);
  cnt_scc2[ss].assign(scc_len[ss] + 1, 0);
  for (auto &np : edges_scc[ss]) {
    int ns = np.first;
    int cn = np.second.first;
    int nn = np.second.second;
    if (ns != sp) {
      int tmp = 1 + dfs_scc(ns, nn, ss);
      if (tmp > cnt_scc2[ss][cn]) {
        cnt_scc2[ss][cn] = tmp;
        swap(cnt_scc1[ss][cn], cnt_scc2[ss][cn]);
      }
    }
  }
  int res = 0;
  int ls = scc_len[ss];
  for (int i = 0; i < ls / 2 + 1; i += 1) {
    int id = sid + i;
    if (id > ls) id -= ls;
    res = max(res, i + cnt_scc1[ss][id]);
  }
  for (int i = 0; i < ls / 2 + 1; i += 1) {
    int id = sid - i;
    if (id < 1) id += ls;
    res = max(res, i + cnt_scc1[ss][id]);
  }
  return res;
}
int cal(int ss, int sid, int sp, int pl) {
  if (pl + 1 > cnt_scc2[ss][sid]) {
    cnt_scc2[ss][sid] = pl + 1;
    if (cnt_scc2[ss][sid] > cnt_scc1[ss][sid])
      swap(cnt_scc1[ss][sid], cnt_scc2[ss][sid]);
  }
  int ls = scc_len[ss];
  cnt_cyc[ss].assign(ls + 1, 0);
  for (int flag = 1; flag >= -1; flag -= 2) {
    priority_queue<pair<int, int>> pq;
    int idx = 0;
    for (idx = 0; idx < ls / 2 + 1; idx += 1) {
      int id = sid + idx * flag;
      if (id > ls)
        id -= ls;
      else if (id < 1)
        id += ls;
      pq.push({cnt_scc1[ss][id] + idx, idx});
    }
    int jdx = 0;
    while (jdx < ls) {
      int id = sid + jdx * flag;
      if (id > ls)
        id -= ls;
      else if (id < 1)
        id += ls;
      while (!pq.empty()) {
        if (pq.top().second <= jdx)
          pq.pop();
        else {
          cnt_cyc[ss][id] = max(cnt_cyc[ss][id], pq.top().first - jdx);
          break;
        }
      }
      int nid = sid + idx * flag;
      while (nid > ls) nid -= ls;
      while (nid < 1) nid += ls;
      pq.push({cnt_scc1[ss][nid] + idx, idx});
      idx += 1;
      jdx += 1;
    }
  }
  for (auto &np : edges_scc[ss]) {
    int ns = np.first;
    int cn = np.second.first;
    int nn = np.second.second;
    if (ns == sp) continue;
    if (cnt_scc1[ss][cn] == cnt_scc1[ns][nn] + 1)
      cal(ns, nn, ss, max(cnt_scc2[ss][cn], cnt_cyc[ss][cn]));
    else
      cal(ns, nn, ss, max(cnt_scc1[ss][cn], cnt_cyc[ss][cn]));
  }
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i += 1) {
    int u, v;
    cin >> u >> v;
    edges[u].push_back(v);
    edges[v].push_back(u);
  }
  tarjan(1, 0);
  add_edges_of_scc(n);
  dfs_scc(scc[1].first, scc[1].second, 0);
  cal(scc[1].first, scc[1].second, 0, -1);
  for (int i = 1; i <= n; i += 1) {
    int ss = scc[i].first;
    int sid = scc[i].second;
    cout << max(cnt_scc1[ss][sid], cnt_cyc[ss][sid]) << " ";
  }
  cout << endl;
}
