#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    int n,m; cin >> n >> m;
    vector g(n, vector<int>(0));
    for (size_t i=0; i<m; i++) {
        int u,v; cin >> u >> v;
        --u; --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    deque<int> q = {0};
    vector<int> dist(n, n+1);
    dist[0] = 0;
    while (q.size() > 0) {
        ll x = q.front(); q.pop_front();
        for (auto y : g[x]) {
            if (dist[y] > dist[x] + 1) {
                dist[y] = dist[x] + 1;
                q.push_back(y);
            }
        }
    }
    vector<int> ans(n+1, 0);
    for (size_t i=0; i<n; i++) {
        if (dist[i] <= n) ans[dist[i]]++;
    }
    for (size_t i=0; i<n; i++) ans[i+1] += ans[i];
    for (size_t i=1; i<=n; i++) cout << ans[i] << '\n';
}