#include namespace { #pragma GCC diagnostic ignored "-Wunused-function" #include #pragma GCC diagnostic warning "-Wunused-function" using namespace std; using namespace atcoder; #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--) #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) template bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; } using ll = long long; using P = pair; using VI = vector; using VVI = vector; using VL = vector; using VVL = vector; vector bfs(const vector>& g, int s=0) { const int n = g.size(); vector dist(n, -1); vector q(n); q[0] = s; dist[s] = 0; int l = 0, r = 1; while(l < r) { int u = q[l++]; int nd = dist[u] + 1; for(int v: g[u]) if (dist[v] == -1) { dist[v] = nd; q[r++] = v; } } return dist; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int n, m; cin >> n >> m; VVI to(n); rep(_, m) { int u, v; cin >> u >> v; u--, v--; to[u].emplace_back(v); to[v].emplace_back(u); } if (to[0].empty()) { rep(i, n) cout << 0 << '\n'; return 0; } auto dist = bfs(to); VI ans(n + 1); for (int d : dist) if (d != -1) ans[d]++; rep(i, n - 1) ans[i+2] += ans[i]; for (int i = 1; i <= n; i++) cout << ans[i] << '\n'; }