#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace std;

typedef long long ll;

template <typename T> struct Graph {
    struct edge {
        int to;
        T cost;
    };
    int N;
    vector<vector<edge>> G;
    vector<T> dist;
    vector<int> prever;

    Graph(int n) { init(n); }
    T inf() {
        if (is_same_v<T, int>)
            return 1e9;
        else
            return 1e18;
    }
    T zero() { return T(0); }

    void init(int n) {
        N = n;
        G.resize(N);
        dist.resize(N, inf());
    }
    void add_edge(int s, int t, T cost) {
        edge e;
        e.to = t, e.cost = cost;
        G[s].push_back(e);
    }
    void dijkstra(int s) {
        rep(i, 0, N) dist[i] = inf();
        prever = vector<int>(N, -1);
        dist[s] = zero();
        priority_queue<pair<T, int>, vector<pair<T, int>>,
                       greater<pair<T, int>>>
            q;
        q.push({zero(), s});
        while (!q.empty()) {
            int now;
            T nowdist;
            tie(nowdist, now) = q.top();
            q.pop();
            if (dist[now] < nowdist)
                continue;
            for (auto e : G[now]) {
                T nextdist = nowdist + e.cost; // 次の頂点への距離
                if (dist[e.to] > nextdist) {
                    prever[e.to] = now;
                    dist[e.to] = nextdist;
                    q.push({dist[e.to], e.to});
                }
            }
        }
    }

    vector<int> get_path(int t) { // tへの最短路構築
        if (dist[t] >= inf())
            return {-1};
        vector<int> path;
        for (; t != -1; t = prever[t]) {
            path.push_back(t);
        }
        reverse(path.begin(), path.end());
        return path;
    }
};

int main() {
    int n, m;
    cin >> n >> m;
    Graph<int> gr(n);
    rep(i, 0, m) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        gr.add_edge(a, b, 1);
        gr.add_edge(b, a, 1);
    }
    gr.dijkstra(0);
    vector<int> dist(n + 10);
    rep(i, 0, n) {
        if (gr.dist[i] != gr.inf()) {
            dist[gr.dist[i]]++;
        }
    }
    int e = dist[0], o = 0;
    vector<int> ans;
    rep(i, 1, n + 1) {
        if (i % 2) {
            o += dist[i];
            ans.push_back(o);
        } else {
            e += dist[i];
            ans.push_back(e);
        }
        if (ans.back() == 0)
            break;
    }
    while (ans.size() < n)
        ans.push_back(0);
    rep(i, 0, n) cout << ans[i] << endl;
}