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;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
ostream &operator<<(ostream &o, ii p) {
  return o << "(" << p.first << ", " << p.second << ")";
}
static const int MAX = 500100;
static vi cycle_nodes[MAX];
static int cycle_of[MAX];
static vi c_nbors[MAX];
static int pos_in_cycle[MAX];
static int N, cN;
static vi nbors[MAX];
struct Edge {
  int u, v, dp;
  bool is_solved;
  Edge *reverse;
  bool is_on_cycle() { return cycle_of[u] == cycle_of[v]; }
};
static vector<Edge> edges[MAX];
static bool seen[MAX];
static bool taken[MAX];
static int trpos[MAX];
static void add_cycle(int *l, int *r) {
  int id = ++cN;
  ((void)0);
  int pos = 0;
  for (int *it = l; it != r; it++) {
    ((void)0);
    cycle_nodes[id].push_back(*it);
    taken[*it] = true;
    cycle_of[*it] = id;
    pos_in_cycle[*it] = pos++;
  }
}
static void find_cycles(int u, int p) {
  static vi trace;
  if (seen[u]) {
    int l = trpos[u];
    int r = trace.size();
    add_cycle(&trace[l], &trace[r]);
  } else {
    trpos[u] = trace.size();
    trace.push_back(u);
    seen[u] = true;
    for (int v : nbors[u])
      if (v != p && !taken[v]) find_cycles(v, u);
    if (!taken[u]) {
      add_cycle(&trace[trpos[u]], &trace[trpos[u] + 1]);
    }
    trace.pop_back();
  }
}
static void connect_cycles() {
  for (auto id = (1); id < (cN + 1); id++) {
    for (int u : cycle_nodes[id]) {
      for (int v : nbors[u])
        if (cycle_of[v] != id) {
          ((void)0);
          c_nbors[id].push_back(cycle_of[v]);
        }
    }
  }
}
static Edge *that_edge[MAX];
static int dist(int u, int v) {
  assert(cycle_of[u] == cycle_of[v]);
  int m = cycle_nodes[cycle_of[u]].size();
  int d1 = (pos_in_cycle[u] - pos_in_cycle[v] + m) % m;
  int d2 = (pos_in_cycle[v] - pos_in_cycle[u] + m) % m;
  int d = min(d1, d2);
  ((void)0);
  return d;
}
static int qdata[MAX * 2];
static int ql, qr;
static void q_reset() {
  ql = qr = 0;
  ((void)0);
}
static pair<int, int> q_top() {
  assert(ql < qr);
  ii r;
  if (ql + 1 < qr)
    r = {qdata[ql], qdata[ql + 1]};
  else
    r = {qdata[ql], -MAX};
  ((void)0);
  return r;
}
static void q_pop(int x) {
  if (ql < qr && qdata[ql] == x) {
    ql++;
  }
}
static void q_push(int x) {
  while (ql < qr && qdata[qr - 1] < x) {
    qr--;
  }
  qdata[qr++] = x;
}
static void q_pop(ii x) {
  ((void)0);
  q_pop(x.first);
  q_pop(x.second);
}
static void q_push(ii x) {
  ((void)0);
  q_push(x.first);
  q_push(x.second);
}
static void add(pair<int, int> &h, int g) {
  if (h.first <= g) {
    h.second = h.first;
    h.first = g;
  } else if (h.second < g)
    h.second = g;
}
static void add(pair<int, int> &h, pair<int, int> g) {
  add(h, g.first);
  add(h, g.second);
}
static ii operator-(ii x, int y) { return {x.first - y, x.second - y}; }
static ii operator+(ii x, int y) { return {x.first + y, x.second + y}; }
static int get_best(ii heap, int x) {
  if (heap.first == x)
    return heap.second;
  else
    return heap.first;
}
static int ans[MAX];
static bool is_finalized[MAX];
static void finalize(int id) {
  if (is_finalized[id]) return;
  is_finalized[id] = true;
  ((void)0);
  static ii buf[MAX * 2];
  static ii tmp[MAX];
  int n = cycle_nodes[id].size();
  for (auto i = (0); i < (n); i++) {
    int u = cycle_nodes[id][i];
    ii x = {0, -MAX};
    for (Edge &out : edges[u])
      if (!out.is_on_cycle()) {
        assert(out.is_solved);
        add(x, out.dp + 1);
      }
    buf[i] = x;
    ((void)0);
  }
  copy(buf, buf + n, buf + n);
  int f = (n + 1) / 2;
  int b = n / 2;
  for (auto i = (0); i < (n); i++) tmp[i] = {0, 0};
  q_reset();
  for (auto i = (0); i < (f); i++) q_push(buf[i] + i);
  for (auto i = (0); i < (n); i++) {
    add(tmp[i], q_top() - i);
    ((void)0);
    q_pop(buf[i] + i);
    q_push(buf[i + f] + f + i);
  }
  if (n > 1) {
    q_reset();
    for (int i = b - 1; i >= 0; i--) q_push(buf[n - i - 1] + i + 1);
    for (auto i = (0); i < (n); i++) {
      add(tmp[i], q_top() + i);
      ((void)0);
      q_pop(buf[n - b + i] - i + b);
      q_push(buf[n + i] - i);
    }
  }
  for (auto i = (0); i < (n); i++) {
    int u = cycle_nodes[id][i];
    ans[u] = tmp[i].first;
    ((void)0);
    for (Edge &out : edges[u])
      if (!out.is_on_cycle()) {
        Edge &in = *out.reverse;
        in.is_solved = true;
        assert(in.v == u);
        in.dp = get_best(tmp[i], out.dp + 1);
        ((void)0);
      }
  }
}
static void solve(Edge &e) {
  if (e.is_solved) return;
  ((void)0);
  int id = cycle_of[e.v];
  if (that_edge[id]) {
    assert(&e != that_edge[id]);
    solve(*that_edge[id]);
    finalize(id);
  } else {
    that_edge[id] = e.reverse;
    int ans = 0;
    for (int u : cycle_nodes[id]) {
      ans = max(ans, dist(e.v, u));
      for (Edge &out : edges[u])
        if (!out.is_on_cycle() && out.v != e.u) {
          solve(out);
          ans = max(ans, dist(e.v, out.u) + 1 + out.dp);
        }
    }
    e.dp = ans;
    e.is_solved = true;
    ((void)0);
  }
}
int main() {
  int m;
  cin >> N >> m;
  ii *mem = new ii[m];
  for (auto i = (0); i < (m); i++) {
    int u, v;
    cin >> u >> v;
    mem[i] = {u, v};
    nbors[u].push_back(v);
    nbors[v].push_back(u);
    edges[u].push_back({u, v, -1, false, nullptr});
    edges[v].push_back({v, u, -1, false, nullptr});
  }
  static int deg[MAX];
  for (auto i = (0); i < (m); i++) {
    int u = mem[i].first;
    int v = mem[i].second;
    edges[u][deg[u]].reverse = &edges[v][deg[v]];
    edges[v][deg[v]].reverse = &edges[u][deg[u]];
    deg[u]++;
    deg[v]++;
  }
  find_cycles(1, 1);
  connect_cycles();
  for (auto i = (1); i < (N + 1); i++) {
    for (auto &e : edges[i])
      if (!e.is_on_cycle()) {
        solve(e);
      }
  }
  for (auto id = (1); id < (cN + 1); id++) {
    finalize(id);
  }
  for (auto i = (1); i < (N + 1); i++) {
    printf("%i%c", ans[i], " \n"[i == N]);
  }
  return 0;
}
