#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    int N, M;
    cin >> N >> M;
    vector<vector<int>> G(N);
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    vector<int> dst(N, INF);
    dst[0] = 0;
    queue<int> que;
    que.push(0);

    while (!que.empty()) {
        int now = que.front();
        que.pop();

        for (int nxt : G[now]) {
            if (dst[nxt] > dst[now] + 1) {
                dst[nxt] = dst[now] + 1;
                que.push(nxt);
            }
        }
    }

    vector<int> ans(N + 1);
    for (int i = 0; i < N; i++) {
        if (dst[i] != INF) ans[dst[i]]++;
    }
    for (int i = 0; i + 2 <= N; i++) {
        ans[i + 2] += ans[i];
    }

    for (int i = 1; i <= N; i++) {
        cout << ans[i] << '\n';
    }
}