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 int N = 7e5 + 10;
const int INF = 0x3f3f3f3f;
int n, m, scc, timer;
int low[N], num[N], com[N], p[N], spec[N], ans[N];
int a[N], val[N], d[N];
bool fre[N];
vector<int> adj[N], V[N], node[N], C[N];
stack<int> ST;
struct RMQ {
  static const int LG = 20;
  int n;
  int lg[N];
  int spT[N][LG];
  void Init(int _n, int a[], int d) {
    n = _n;
    for (int i = 0; i < n; ++i) spT[i][0] = a[i] + d * i;
    for (int j = 1; 1 << j <= n; ++j)
      for (int i = 0; i + (1 << j) - 1 < n; ++i)
        spT[i][j] = max(spT[i][j - 1], spT[i + (1 << (j - 1))][j - 1]);
    for (int i = 0; 1 << i <= n; ++i) lg[1 << i] = i;
    for (int i = 1; i <= n; ++i)
      if (!lg[i]) lg[i] = lg[i - 1];
  }
  int Query(int l, int r) {
    if (l > r) return 0;
    int k = lg[r - l + 1];
    return max(spT[l][k], spT[r - (1 << k) + 1][k]);
  }
} RMQ[2];
struct Edge {
  int u, v;
  Edge() {}
  Edge(int u, int v) : u(u), v(v) {}
} E[N];
void Tarjan(int u, int par = -1) {
  ST.push(u);
  low[u] = num[u] = ++timer;
  for (int k = 0; k < adj[u].size(); ++k) {
    int v = adj[u][k];
    if (v == par || fre[v] == true) continue;
    if (num[v])
      low[u] = min(low[u], num[v]);
    else {
      Tarjan(v, u);
      low[u] = min(low[u], low[v]);
    }
  }
  if (low[u] == num[u]) {
    int v;
    ++scc;
    do {
      v = ST.top();
      ST.pop();
      fre[v] = true;
      com[v] = scc;
      V[scc].push_back(v);
    } while (v != u);
  }
}
int Left(int p, int m, int n) {
  int cut = (p + m - 1) % n;
  if (cut < p) {
    int s = max(RMQ[0].Query(p + 1, n - 1) - p, RMQ[0].Query(0, cut) - p + n);
    return max(s, 0);
  } else {
    int s = RMQ[0].Query(p + 1, cut) - p;
    return max(s, 0);
  }
}
int Right(int p, int m, int n) {
  int cut = (p + m - 1) % n;
  cut = (cut + 1) % n;
  if (cut <= p) {
    int s = RMQ[1].Query(cut, p - 1) + p;
    return max(s, 0);
  } else {
    int s = max(RMQ[1].Query(cut, n - 1) + p + n, RMQ[1].Query(0, p - 1) + p);
    return max(s, 0);
  }
}
void getAns(int scc) {
  for (int k = 0; k < V[scc].size(); ++k) {
    int u = V[scc][k];
    a[k] = val[u];
  }
  int sz = V[scc].size();
  RMQ[0].Init(sz, a, +1);
  RMQ[1].Init(sz, a, -1);
  for (int k = 0; k < V[scc].size(); ++k) {
    int u = V[scc][k];
    int l = 1, r = sz, f = INF;
    while (l <= r) {
      int m = (l + r) >> 1;
      int L = Left(k, m, sz), R = Right(k, m, sz);
      if (L > R) {
        r = m - 1;
        f = min(f, L);
      } else if (L < R) {
        l = m + 1;
        f = min(f, R);
      } else {
        f = min(f, L);
        break;
      }
    }
    ans[u] = (f == INF ? 0 : f);
  }
}
void BFS() {
  for (int i = 1; i <= n; ++i) fre[i] = false;
  queue<int> Q;
  Q.push(V[1][0]);
  fre[V[1][0]] = true;
  vector<int> ver;
  while (Q.size()) {
    int u = Q.front();
    Q.pop();
    ver.push_back(u);
    for (int k = 0; k < adj[u].size(); ++k) {
      int v = adj[u][k];
      if (fre[v] == false) {
        fre[v] = true;
        Q.push(v);
        p[v] = u;
      }
    }
  }
  int maxDist = 0;
  for (int i = (int)ver.size() - 1; i >= 0; --i) {
    int u = ver[i];
    for (int k = 0; k < adj[u].size(); ++k) {
      int v = adj[u][k];
      if (p[v] == u) {
        d[u] = max(d[u], d[v] + 1);
        if (com[u] != com[v]) val[u] = max(val[u], d[v] + 1);
      }
    }
  }
  for (int i = 1; i <= n; ++i) fre[i] = false;
}
void moveRoot(int u, int upValue) {
  int scc = com[u];
  val[u] = max(val[u], upValue);
  if (V[scc].size() == 1) {
    int x = V[scc][0];
    ans[x] = upValue;
  } else
    getAns(scc);
  for (int k = 0; k < V[scc].size(); ++k) {
    int u = V[scc][k];
    int firstMax = 0, secondMax = 0;
    for (int i = 0; i < node[u].size(); ++i) {
      int v = node[u][i];
      if (p[v] == u) {
        if (d[v] + 1 > secondMax) {
          secondMax = d[v] + 1;
          if (firstMax < secondMax) swap(firstMax, secondMax);
        }
      }
    }
    for (int i = 0; i < node[u].size(); ++i) {
      int v = node[u][i];
      if (p[v] == u) {
        int passValue;
        if (d[v] + 1 == firstMax) {
          passValue = max(ans[u], secondMax);
        } else {
          passValue = max(ans[u], firstMax);
        }
        moveRoot(v, passValue + 1);
      }
    }
  }
}
void Read(int &n) {
  n = 0;
  char c;
  do {
    c = getchar();
  } while (!isdigit(c));
  do {
    n = n * 10 + c - '0';
    c = getchar();
  } while (isdigit(c));
}
void Write(int n) {
  if (n == 0) {
    putchar('0');
    return;
  }
  char c[30];
  int k = 0;
  while (n) {
    c[++k] = n % 10 + '0';
    n /= 10;
  }
  for (int i = k; i >= 1; --i) putchar(c[i]);
}
int main() {
  Read(n);
  Read(m);
  for (int i = 1; i <= m; ++i) {
    int u, v;
    Read(u);
    Read(v);
    E[i] = Edge(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  Tarjan(1);
  for (int i = 1; i <= m; ++i) {
    int u = E[i].u, v = E[i].v;
    if (com[u] == com[v])
      continue;
    else {
      node[u].push_back(v);
      node[v].push_back(u);
    }
  }
  BFS();
  moveRoot(V[1][0], 0);
  for (int i = 1; i <= n; ++i) {
    Write(max(val[i], ans[i]));
    putchar(' ');
  }
  return 0;
}
