#include <iostream>
#include <vector>
#include <queue>

using namespace std;
using ll = long long;

int main () {
    // i回目のイベントで深さiまでの頂点が影響を受ける。
    int N, M; cin >> N >> M;
    vector<vector<int>> graph(N);

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

    // 頂点0が孤立しているときがコーナーケース
    if (graph[0].size() == 0) {
        for (int i = 0; i < N; i++) cout << 0 << "\n";
        return 0;
    }

    vector<int> dist(N, -1);
    dist[0] = 0;

    queue<int> q;
    q.push(0);

    while (!q.empty()) {
        auto pos = q.front(); q.pop();
        for (auto nex: graph[pos]) {
            if (dist[nex] == -1) {
                dist[nex] = dist[pos] + 1;
                q.push(nex);
            }
        }
    }


    vector<int> count(N + 1);
    for (int i = 0; i < N; i++) if (0 <= dist[i]) count[dist[i]]++;

    vector<int> acc_even(N + 1), acc_odd(N + 1);
    for (int i = 0; i <= N; i++) {
        if (0 <= i - 1) {
            acc_even[i] = acc_even[i - 1];
            acc_odd[i] = acc_odd[i - 1];
        }

        if (i % 2 == 0) {
            acc_even[i] += count[i];
        }

        if (i % 2 == 1) {
            acc_odd[i] += count[i];
        }
    }

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

        if (i % 2 == 1) {
            ans[i] = acc_odd[i];
        }
    }

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

    return 0;
}