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 long long mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f;
const double eps = 1e-10;
int lowbit(int x) { return x & (-x); }
long long powmod(long long x, long long k) {
  long long res = 1;
  for (; k; k >>= 1, x = x * x % mod)
    if (k & 1) res = res * x % mod;
  return res;
}
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
template <class _>
void Min(_ &a, _ b) {
  if (a > b) a = b;
}
template <class _>
void Max(_ &a, _ b) {
  if (a < b) a = b;
}
template <class _>
void add(_ &a, _ b) {
  a += b;
  if (a >= mod) a -= mod;
}
template <class _>
void read(_ &x) {
  static char c;
  x = 0;
  while (c = getchar(), c < 48)
    ;
  do x = (x << 3) + (x << 1) + (c ^ 48);
  while (c = getchar(), c > 47);
}
const int N = 5e5 + 50;
const int M = 1e6 + 50;
int n, m;
int ans[N];
int head[N], nxt[M << 1], to[M << 1], edge_tot;
int dfn[N], low[N], bccno[N], stk[N], mark[N], top, dfn_cnt, bcc_cnt;
vector<int> bcc[N];
bool vis[M << 1];
int que[N], l, r;
int dis[N], tmp[N << 1];
int fir[N], sec[N], mlg[N], llg[N];
int L, R;
pair<int, int> Q[N];
void add_edge(int u, int v) {
  nxt[++edge_tot] = head[u], head[u] = edge_tot, to[edge_tot] = v;
}
void tarjan(int u, int f) {
  low[u] = dfn[u] = ++dfn_cnt;
  stk[++top] = u;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == f) continue;
    if (!dfn[v]) {
      tarjan(v, u);
      Min(low[u], low[v]);
    } else
      Min(low[u], dfn[v]);
  }
  if (dfn[u] == low[u]) {
    int v;
    bcc_cnt++;
    do {
      v = stk[top--];
      bccno[v] = bcc_cnt;
      bcc[bcc_cnt].push_back(v);
    } while (u ^ v);
  }
}
void bfs() {
  memset(dis, -1, sizeof(dis));
  que[r++] = 1, dis[1] = 0;
  while (l < r) {
    int u = que[l++];
    for (int i = head[u]; i; i = nxt[i]) {
      int v = to[i];
      if (~dis[v]) continue;
      dis[v] = dis[u] + 1;
      vis[i] = vis[i ^ 1] = 1;
      que[r++] = v;
    }
  }
}
void deal(int u, int v) {
  if (v > fir[u])
    sec[u] = fir[u], fir[u] = v;
  else if (v > sec[u])
    sec[u] = v;
}
void dfs(int u, int f) {
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (!vis[i] || v == f) continue;
    dfs(v, u);
    Max(llg[u], llg[v] + 1);
    if (bccno[v] ^ bccno[u]) deal(u, llg[v] + 1);
  }
}
void solve(int u, int f) {
  int nbc = bccno[u];
  if (!mark[nbc]) {
    mark[nbc] = 1;
    int sz = ((int)(bcc[nbc]).size()), rot = bcc[nbc][sz - 1];
    for (int k = (0), __t = (sz); k < __t; ++k) {
      int now = bcc[nbc][k];
      tmp[k] = now;
      Max(mlg[now], fir[now]);
    }
    for (int k = (sz), __t = (sz * 2); k < __t; ++k) tmp[k] = tmp[k - sz];
    for (int _ = 2; _; _--) {
      int d = 0;
      L = R = 0;
      for (int k = (0), __t = (sz * 2); k < __t; ++k) {
        int now = tmp[k], nowd = ++d;
        while (L < R && nowd - Q[L].second > sz / 2) L++;
        if (L < R) deal(now, nowd - Q[L].second + mlg[Q[L].first]);
        while (L < R &&
               -nowd + mlg[now] > -Q[R - 1].second + mlg[Q[R - 1].first])
          R--;
        Q[R++] = make_pair(now, nowd);
      }
      reverse(tmp, tmp + sz * 2);
    }
  }
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == f || !vis[i]) continue;
    if (bccno[v] ^ bccno[u]) {
      if (llg[v] + 1 == fir[u])
        deal(v, sec[u] + 1);
      else
        deal(v, fir[u] + 1);
    }
    solve(v, u);
  }
}
int main() {
  edge_tot = 1;
  scanf("%d%d", &n, &m);
  for (int i = (1), __t = (m + 1); i < __t; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    add_edge(u, v);
    add_edge(v, u);
  }
  tarjan(1, 0);
  bfs();
  dfs(1, 0);
  solve(1, 0);
  for (int i = (1), __t = (n + 1); i < __t; ++i) printf("%d\n", fir[i]);
  return 0;
}
