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;
class Solution {
 public:
  vector<int> minimizeDistance(vector<pair<int, int>>& edges, int n) {
    graph.clear();
    graph.resize(n);
    parents.clear();
    parents.resize(n, -1);
    root = 0;
    gid.clear();
    gid.resize(n, -1);
    gidx.clear();
    gidx.resize(n, -1);
    for (auto& e : edges) {
      int u = e.first, v = e.second;
      graph[u].push_back(v);
      graph[v].push_back(u);
    }
    ord.clear();
    ord.reserve(n);
    vector<int> path;
    dfs(root, -1, path);
    vector<int> res;
    calc(res);
    return res;
  }

 private:
  vector<vector<int>> graph;
  vector<int> parents;
  int root;
  vector<int> gid;
  vector<int> gidx;
  vector<vector<int>> groups;
  vector<int> ord;
  vector<multiset<int>> subdis;
  void dfs(int u, int p, vector<int>& path) {
    parents[u] = p;
    path.push_back(u);
    gid[u] = -2;
    for (auto v : graph[u]) {
      if (v == p || gid[v] >= 0) {
        continue;
      }
      if (gid[v] == -2) {
        int i = path.size();
        int w = -1;
        groups.resize(groups.size() + 1);
        do {
          w = path[--i];
          gid[w] = groups.size() - 1;
          groups.back().push_back(w);
        } while (w != v);
        auto& cycle = groups.back();
        reverse(cycle.begin(), cycle.end());
        for (int i = 0; i < cycle.size(); ++i) {
          gidx[cycle[i]] = i;
        }
        continue;
      }
      dfs(v, u, path);
    }
    if (gid[u] == -2) {
      gid[u] = groups.size();
      groups.emplace_back(vector<int>{u});
    } else {
    }
    path.pop_back();
    ord.push_back(u);
  }
  void calc(vector<int>& res) {
    int n = graph.size();
    vector<int> dis1(n, 0);
    subdis.clear();
    subdis.resize(n);
    res.clear();
    res.resize(n, -1);
    vector<int> cycleDis(n, 0);
    for (auto u : ord) {
      int p = parents[u];
      for (auto v : graph[u]) {
        if (v == p) {
          continue;
        }
        if (gid[u] == gid[v]) {
          continue;
        }
        dis1[u] = max(dis1[u], dis1[v] + 1);
        subdis[u].insert(dis1[v] + 1);
      }
      if ((p == -1 || gid[p] != gid[u]) && groups[gid[u]].size() > 1) {
        cycleDis[u] = minMaxDistance(u, dis1);
        dis1[u] = max(dis1[u], cycleDis[u]);
      }
    }
    for (int i = n - 1; i >= 0; --i) {
      int u = ord[i];
      int p = parents[u];
      if (res[u] != -1) {
        continue;
      }
      res[u] = dis1[u];
      if (p != -1 && gid[p] != gid[u]) {
        auto it = subdis[p].rbegin();
        if (*it == 1 + dis1[u]) {
          ++it;
        }
        if (it != subdis[p].rend()) {
          subdis[u].insert(*it + 1);
        } else {
          subdis[u].insert(1);
        }
        res[u] = max(res[u], *subdis[u].rbegin());
      }
      if ((p == -1 || gid[p] != gid[u]) && groups[gid[u]].size() > 1) {
        auto it = subdis[u].rbegin();
        if (it != subdis[u].rend()) {
          dis1[u] = *it;
        } else {
          dis1[u] = 0;
        }
        minMaxDistance2(u, dis1, cycleDis);
        auto& cycle = groups[gid[u]];
        for (auto v : cycle) {
          subdis[v].insert(cycleDis[v]);
          res[v] = max(res[v], max(dis1[v], cycleDis[v]));
        }
      }
    }
  }
  int minMaxDistance(int u, vector<int>& dis) {
    auto& cycle = groups[gid[u]];
    int p = gidx[u];
    int n = cycle.size();
    int res = 0;
    for (int i = 0; i < n; ++i) {
      if (i == p) {
        continue;
      }
      res = max(res, min(abs(i - p), abs(n - (i - p))) + dis[cycle[i]]);
    }
    return res;
  }
  void minMaxDistance2(int u, vector<int>& dis, vector<int>& res) {
    auto& cycle = groups[gid[u]];
    int n = cycle.size();
    vector<int> dis2(n, 0);
    multiset<int, greater<int>> left;
    multiset<int, greater<int>> right;
    left.insert(INT_MIN / 2);
    right.insert(INT_MIN / 2);
    dis2[0] = 0;
    int m = max(1, (n - 1) / 2);
    for (int i = 1; i <= m; ++i) {
      dis2[i] = dis[cycle[i]] + i;
      right.insert(dis2[i]);
    }
    for (int i = m + 1; i < n; ++i) {
      dis2[i] = dis[cycle[i]] + n - i;
      left.insert(dis2[i]);
    }
    res[cycle[0]] = max(*left.cbegin(), *right.cbegin());
    int r = m + 1;
    for (int i = 1; i < n; ++i) {
      dis2[i - 1] = dis[cycle[i - 1]] - (i - 1);
      left.insert(dis2[i - 1]);
      if (r < n) {
        left.erase(left.find(dis2[r]));
        if (r > i) {
          dis2[r] = dis[cycle[r]] + r;
          right.insert(dis2[r]);
        } else {
          dis2[r] = dis[cycle[r]] + n + r;
          right.insert(dis2[r]);
        }
        r = (r + 1) % n;
      }
      right.erase(right.find(dis2[i]));
      res[cycle[i]] = max(*left.cbegin() + i, *right.cbegin() - i);
    }
  }
  int minMaxDistance3(int u, vector<int>& dis) {
    auto& cycle = groups[gid[u]];
    int p = gidx[u];
    int cnt = 1;
    int n = cycle.size();
    int l = p;
    int r = p;
    int lcnt = 0;
    int rcnt = 0;
    int lsum = 0;
    int rsum = 0;
    while (cnt < n) {
      if (lsum < rsum) {
        l = (l - 1 + n) % n;
        ++lcnt;
        ++cnt;
        lsum = max(lsum, lcnt + dis[cycle[l]]);
      } else if (lsum > rsum) {
        r = (r + 1) % n;
        ++rcnt;
        ++cnt;
        rsum = max(rsum, rcnt + dis[cycle[r]]);
      } else {
        if (cnt + 1 == n) {
          if (lcnt > rcnt) {
            r = (r + 1) % n;
            ++rcnt;
            ++cnt;
            rsum = max(rsum, rcnt + dis[cycle[r]]);
          } else {
            l = (l - 1 + n) % n;
            ++lcnt;
            ++cnt;
            lsum = max(lsum, lcnt + dis[cycle[l]]);
          }
        } else {
          r = (r + 1) % n;
          ++rcnt;
          ++cnt;
          rsum = max(rsum, rcnt + dis[cycle[r]]);
          l = (l - 1 + n) % n;
          ++lcnt;
          ++cnt;
          lsum = max(lsum, lcnt + dis[cycle[l]]);
        }
      }
    }
    return max(lsum, rsum);
  }
};
int main(int argc, char** argv) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> edges;
  edges.reserve(m);
  for (int i = 0, u = 0, v = 0; i < m; ++i) {
    cin >> u >> v;
    edges.emplace_back(u - 1, v - 1);
  }
  Solution sol;
  auto res = sol.minimizeDistance(edges, n);
  for (auto r : res) {
    cout << r << " ";
  }
  cout << endl;
  return 0;
}
