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;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et() {
  puts("-1");
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
template <typename T>
void maxtt(T &t1, T t2) {
  t1 = max(t1, t2);
}
void maxi(int &x, int y) { x = max(x, y); }
vector<pair<int, int> > mp[1000005];
int dfn[1000005], sta[1000005], low[1000005], color, ii, cnt, belong[1000005];
bool ins[1000005];
void tarjan(int x, int p) {
  dfn[x] = low[x] = ++ii;
  sta[++cnt] = x;
  ins[x] = 1;
  for (auto cc : mp[x])
    if (cc.first != p) {
      int child = cc.first;
      if (!dfn[child]) {
        tarjan(child, x);
        low[x] = min(low[x], low[child]);
      } else if (ins[child]) {
        low[x] = min(low[x], dfn[child]);
      }
    }
  if (dfn[x] == low[x]) {
    ++color;
    int t;
    do {
      t = sta[cnt];
      cnt--;
      ins[t] = 0;
      belong[t] = color;
    } while (dfn[t] != low[t]);
  }
}
bool isB[1000005], vis[1000005];
vector<int> cyls[1000005];
int U[1000005], V[1000005], pa[1000005];
int L[1000005], Z[1000005], maxLen[1000005];
void findASpanningTreeAndInitializeL(int x) {
  queue<int> q;
  vector<int> nodesByDepth;
  q.push(x);
  memset(vis, 0, sizeof vis);
  vis[x] = 1;
  pa[x] = -1;
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    nodesByDepth.push_back(u);
    for (auto pp : mp[u]) {
      int v = pp.first;
      if (vis[v]) continue;
      vis[v] = 1;
      q.push(v);
      pa[v] = u;
    }
  }
  for (int i = n - 1; ~i; i--) {
    int u = nodesByDepth[i];
    for (auto pp : mp[u]) {
      int v = pp.first;
      if (pa[v] == u) {
        maxLen[u] = max(maxLen[u], maxLen[v] + 1);
        if (isB[pp.second]) {
          L[u] = max(L[u], maxLen[v] + 1);
        }
      }
    }
  }
}
void solveCycles(int u, int p, int upValue) {
  L[u] = max(L[u], upValue);
  int cid = belong[u];
  int k = cyls[cid].size();
  for (int(itr) = 0; (itr) < (int)(2); (itr)++) {
    priority_queue<pair<int, int> > q;
    for (int(i) = 0; (i) < (int)(k + k); (i)++) {
      int stmp = k + k - i;
      while (!q.empty() && q.top().second - stmp > k / 2) {
        q.pop();
      }
      if (!q.empty()) {
        if (cyls[cid][i % k] == 1) {
        }
        maxi(Z[cyls[cid][i % k]], q.top().first - stmp);
      }
      q.push({L[cyls[cid][i % k]] + stmp, stmp});
    }
    reverse(cyls[cid].begin(), cyls[cid].end());
  }
  for (int u : cyls[cid]) {
    int firstMax = 0, secondMax = 0;
    for (auto e : mp[u])
      if (e.first != p && isB[e.second]) {
        int v = e.first;
        if (secondMax < 1 + maxLen[v]) {
          secondMax = 1 + maxLen[v];
          if (firstMax < secondMax) swap(firstMax, secondMax);
        }
      }
    for (auto e : mp[u])
      if (e.first != p && isB[e.second]) {
        int v = e.first;
        int passValue = max(upValue, Z[u]);
        if (firstMax == 1 + maxLen[v])
          passValue = max(passValue, secondMax);
        else
          passValue = max(passValue, firstMax);
        solveCycles(v, u, passValue + 1);
      }
  }
}
void addC(int x) {
  cyls[belong[x]].push_back(x);
  ins[x] = 1;
  for (auto pp : mp[x]) {
    int v = pp.first;
    if (belong[v] != belong[x]) continue;
    if (ins[v]) continue;
    addC(v);
    return;
  }
}
void fmain(int ID) {
  scanf("%d%d", &n, &m);
  for (int(i) = 1; (i) <= (int)(m); (i)++) {
    scanf("%d%d", U + i, V + i);
    mp[U[i]].push_back({V[i], i});
    mp[V[i]].push_back({U[i], i});
  }
  tarjan(1, 0);
  memset(ins, 0, sizeof ins);
  for (int(i) = 1; (i) <= (int)(n); (i)++)
    if (!vis[belong[i]]) {
      vis[belong[i]] = 1;
      addC(i);
    }
  for (int(i) = 1; (i) <= (int)(m); (i)++)
    if (belong[U[i]] != belong[V[i]]) {
      isB[i] = 1;
    }
  findASpanningTreeAndInitializeL(1);
  solveCycles(1, -1, 0);
  for (int(i) = 1; (i) <= (int)(n); (i)++) printf("%d ", max(L[i], Z[i]));
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
