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;
void err() { cout << endl; }
template <class T, class... Ts>
void err(T arg, Ts &...args) {
  cout << arg << ' ';
  err(args...);
}
void read() {}
template <class T, class... Ts>
void read(T &arg, Ts &...args) {
  T f = 1;
  char ch;
  arg = 0;
  for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar()) {
    if (ch == '-') f = -1;
  }
  for (; ch >= '0' && ch <= '9'; ch = getchar()) arg = arg * 10 + ch - '0';
  arg *= f;
  read(args...);
}
template <class T>
void myHash(T a[], int n, T w[] = nullptr) {
  set<T> st;
  for (int i = 0; i < n; i++) {
    st.insert(a[i]);
  }
  int tot = 0;
  map<T, int> mp;
  for (T x : st) {
    mp[x] = ++tot;
  }
  for (int i = 0; i < n; i++) {
    a[i] = mp[a[i]];
  }
  if (w != nullptr) {
    for (pair<T, int> p : mp) {
      w[p.second] = p.first;
    }
  }
}
const int maxn = 5e5 + 7;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
vector<pair<int, int> > G[maxn];
int dfn[maxn], low[maxn], idx;
stack<int> stk;
bool inST[maxn];
int grp[maxn];
vector<int> scc[maxn];
bool isRT[maxn];
void tarjan(int u, int eid) {
  dfn[u] = low[u] = ++idx;
  stk.push(u);
  inST[u] = true;
  for (pair<int, int> e : G[u]) {
    if (e.second == eid) continue;
    int v = e.first;
    if (!dfn[v]) {
      tarjan(v, e.second);
      low[u] = min(low[u], low[v]);
    } else if (inST[v]) {
      low[u] = min(low[u], low[v]);
    }
  }
  if (dfn[u] == low[u]) {
    while (stk.top() != u) {
      int v = stk.top();
      stk.pop();
      inST[v] = false;
      grp[v] = u;
      scc[u].push_back(v);
    }
    stk.pop();
    inST[u] = false;
    grp[u] = u;
    isRT[u] = true;
  }
}
int f[2][maxn];
int fto[maxn], sc[maxn];
int pre[maxn], suf[maxn];
void dp(int u, int fa) {
  assert(grp[u] == u);
  assert(isRT[u]);
  for (pair<int, int> e : G[u]) {
    int v = e.first;
    if (v == fa || grp[v] == u) continue;
    dp(v, u);
    int nxt = max(f[0][v], f[1][v]) + 1;
    if (nxt > f[0][u]) {
      sc[u] = f[0][u];
      fto[u] = v;
      f[0][u] = nxt;
    } else if (nxt > sc[u]) {
      sc[u] = nxt;
    }
  }
  for (int v : scc[u]) {
    assert(v != u);
    for (pair<int, int> e : G[v]) {
      int to = e.first;
      if (grp[to] == u) continue;
      dp(to, v);
      int nxt = max(f[0][to], f[1][to]) + 1;
      if (nxt > f[0][v]) {
        sc[v] = f[0][v];
        fto[v] = to;
        f[0][v] = nxt;
      } else if (nxt > sc[v]) {
        sc[v] = nxt;
      }
    }
  }
  int len = scc[u].size();
  for (int i = 1; i <= len; i++) {
    int v = scc[u][i - 1];
    pre[i] = max(pre[i - 1], f[0][v] + i);
  }
  suf[len + 1] = 0;
  for (int i = len; i >= 1; i--) {
    int v = scc[u][i - 1];
    suf[i] = max(suf[i + 1], f[0][v] + len + 1 - i);
  }
  f[1][u] = inf;
  for (int i = 0; i <= len; i++) {
    f[1][u] = min(f[1][u], max(pre[i], suf[i + 1]));
  }
}
int g[maxn];
int a[maxn * 2], b[maxn * 2];
struct SegTree {
  int info[maxn << 3];
  int n;
  void init(int _n, int w[]) {
    n = _n;
    build(1, 1, n, w);
  }
  void pushup(int x) { info[x] = max(info[x * 2], info[x * 2 + 1]); }
  void build(int x, int l, int r, int w[]) {
    if (l == r) {
      info[x] = w[l];
    } else {
      int mid = l + r >> 1;
      build(x * 2, l, mid, w);
      build(x * 2 + 1, mid + 1, r, w);
      pushup(x);
    }
  }
  int query(int x, int l, int r, int ql, int qr) {
    if (ql <= l && r <= qr) return info[x];
    int mid = l + r >> 1;
    int ans = 0;
    if (ql <= mid) ans = max(ans, query(x * 2, l, mid, ql, qr));
    if (qr > mid) ans = max(ans, query(x * 2 + 1, mid + 1, r, ql, qr));
    return ans;
  }
  int ask(int l, int r) {
    if (l > r) return 0;
    return query(1, 1, n, l, r);
  }
} sgl, sgr;
void dpG(int rt) {
  int n = 1 + scc[rt].size();
  a[1] = max(g[rt], f[0][rt]);
  for (int i = 2; i <= n; i++) {
    int u = scc[rt][i - 2];
    a[i] = f[0][u];
  }
  for (int i = n + 1; i <= n * 2; i++) {
    a[i] = a[i - n];
  }
  for (int i = 1; i <= n * 2; i++) {
    b[i] = a[i] + n * 2 - i;
    a[i] += i;
  }
  sgl.init(n * 2, a);
  sgr.init(n * 2, b);
  int split = 3;
  for (int i = 2, j = n + 2; i <= n; i++, j++) {
    if (split == i) split++;
    while (split < j) {
      int cur[2] = {sgl.ask(i + 1, split - 1) - i,
                    sgr.ask(split, j - 1) - (n * 2 - j)};
      int nxt[2] = {sgl.ask(i + 1, split) - i,
                    sgr.ask(split + 1, j - 1) - (n * 2 - j)};
      if (cur[0] >= cur[1]) break;
      if (max(nxt[0], nxt[1]) > max(cur[0], cur[1])) break;
      split++;
    }
    int u = scc[rt][i - 2];
    g[u] =
        max(sgl.ask(i + 1, split - 1) - i, sgr.ask(split, j - 1) - (n * 2 - j));
  }
}
void dfs(int u, int fa) {
  g[u] = max(g[fa], max(fto[fa] == u ? sc[fa] : f[0][fa], f[1][fa])) + 1;
  if (u == 1) g[u] = 0;
  dpG(u);
  for (pair<int, int> e : G[u]) {
    int v = e.first;
    if (v == fa || grp[v] == u) continue;
    dfs(v, u);
  }
  for (int v : scc[u]) {
    for (pair<int, int> e : G[v]) {
      int to = e.first;
      if (grp[to] == u) continue;
      dfs(to, v);
    }
  }
}
void run() {
  int n, m;
  read(n, m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    read(u, v);
    G[u].emplace_back(v, i);
    G[v].emplace_back(u, i);
  }
  for (int i = 1; i <= n; i++) {
    if (!dfn[i]) tarjan(i, 0);
  }
  dp(1, 0);
  dfs(1, 0);
  for (int i = 1; i <= n; i++) {
    printf("%d%c", max(g[i], max(f[0][i], f[1][i])), i == n ? '\n' : ' ');
  }
}
int main() {
  int T = 1;
  while (T--) {
    run();
  }
  return 0;
}
