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 n, m;
vector<int> g[500010];
vector<int> bfstree[500010];
vector<int> st, ed;
int p[500010];
char used[500010];
char oncycle[500010];
vector<vector<int>> cycles;
int cyclenum[500010];
int l[500010], z[500010];
int an[500010];
multiset<int> ms[500010];
int fi[500010];
vector<pair<int, int>> er;
void dfs1(int v, int par) {
  used[v] = 1;
  for (int to : g[v]) {
    if (!used[to]) {
      p[to] = v;
      dfs1(to, v);
    } else if (to != par && used[to] == 1) {
      ed.push_back(v);
      st.push_back(to);
    }
  }
  used[v] = 2;
}
void dfs2(int v, int par, int di) {
  if (cyclenum[v] >= 0 && fi[cyclenum[v]] == 0) {
    fi[cyclenum[v]] = v;
  }
  for (int to : bfstree[v]) {
    if (to != par) {
      dfs2(to, v, di + 1);
      ms[v].insert(l[to] + 1);
      if (cyclenum[to] != -1 && cyclenum[v] == cyclenum[to])
        er.push_back({v, to});
    }
  }
  if (!ms[v].empty()) l[v] = *ms[v].rbegin();
  an[v] = l[v];
}
void calc_z(vector<int> &a) {
  set<pair<int, int>> q;
  int k = a.size();
  for (int t = 0; t < 2; t++) {
    for (int i = 0; i < 2 * k; i++) {
      while (!q.empty()) {
        auto v = *q.rbegin();
        if (i - v.second > k / 2)
          q.erase(*q.rbegin());
        else
          break;
      }
      if (!q.empty()) {
        auto v = *q.rbegin();
        int value = v.first + v.second;
        value += i - v.second;
        z[a[i % k]] = max(z[a[i % k]], value);
      }
      q.insert({l[a[i % k]] - i, i});
    }
    q.clear();
    reverse(a.begin(), a.end());
  }
  for (auto u : a) an[u] = max(an[u], max(l[u], z[u]));
}
void dfs_go(int v) {
  used[v] = true;
  for (int to : g[v]) {
    if (!used[to]) {
      if (oncycle[to]) {
        if (oncycle[v] && cyclenum[v] == cyclenum[to])
          dfs_go(to);
        else {
          int old = l[to];
          bool ok = false;
          if (ms[v].count(old + 1)) ms[v].erase(ms[v].find(old + 1)), ok = true;
          if (!ms[v].empty())
            l[to] = max(*ms[v].rbegin(), z[v]) + 1;
          else
            l[to] = z[v] + 1;
          calc_z(cycles[cyclenum[to]]);
          dfs_go(to);
          l[to] = old;
          if (ok) ms[v].insert(old + 1);
        }
      } else {
        bool ok = false;
        if (ms[v].count(l[to] + 1))
          ms[v].erase(ms[v].find(l[to] + 1)), ok = true;
        if (!ms[v].empty())
          z[to] = max(*ms[v].rbegin(), z[v]) + 1;
        else
          z[to] = z[v] + 1;
        an[to] = max(an[to], z[to]);
        dfs_go(to);
        if (ok) ms[v].insert(l[to] + 1);
      }
    }
  }
}
void stupid() {
  for (int i = 1; i <= n; i++) {
    int an = 0;
    int d[n + 1];
    memset(d, -1, sizeof(d));
    d[i] = 0;
    queue<int> q;
    q.push(i);
    while (!q.empty()) {
      int v = q.front();
      q.pop();
      an = max(an, d[v]);
      for (int to : g[v]) {
        if (d[to] == -1) {
          d[to] = d[v] + 1;
          q.push(to);
        }
      }
    }
    cout << an << ' ';
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int from, to;
    cin >> from >> to;
    g[from].push_back(to);
    g[to].push_back(from);
  }
  dfs1(1, 1);
  for (int i = 0; i < (int)ed.size(); i++) {
    int u = ed[i];
    cycles.push_back(vector<int>());
    for (int v = u; v != st[i]; v = p[v]) cycles.back().push_back(v);
    cycles.back().push_back(st[i]);
  }
  if (cycles.empty()) {
    cycles.push_back(vector<int>(1, 1));
  }
  memset(cyclenum, -1, sizeof(cyclenum));
  for (int i = 0; i < (int)cycles.size(); i++) {
    for (auto u : cycles[i]) {
      oncycle[u] = true;
      cyclenum[u] = i;
    }
  }
  memset(used, 0, sizeof(used));
  queue<int> q;
  for (auto u : cycles[0]) {
    q.push(u);
    used[u] = true;
  }
  while (!q.empty()) {
    int v = q.front();
    q.pop();
    for (int to : g[v]) {
      if (!used[to]) {
        q.push(to);
        bfstree[v].push_back(to);
        bfstree[to].push_back(v);
        used[to] = true;
      }
    }
  }
  memset(used, 0, sizeof(used));
  for (auto u : cycles[0]) {
    dfs2(u, u, 0);
  }
  reverse(er.begin(), er.end());
  for (auto p : er) {
    int v = p.first;
    if (fi[cyclenum[v]] == v) continue;
    int to = p.second;
    ms[v].erase(ms[v].find(l[to] + 1));
    if (!ms[v].empty())
      l[v] = *ms[v].rbegin();
    else
      l[v] = 0;
    an[v] = l[v];
  }
  calc_z(cycles[0]);
  memset(used, 0, sizeof(used));
  dfs_go(cycles[0][0]);
  for (int i = 1; i <= n; i++) {
    cout << an[i] << ' ';
  }
  cout << endl;
}
