#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define ov4(a, b, c, d, name, ...) name
#define rep3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for(ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for(auto &&e : v)
#define all(a) begin(a), end(a)
#define si(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; }
template <typename T, typename S> bool chmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; }

const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;

#define i128 __int128_t

struct _ {
    _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vi> g(n);
    rep(m) {
        int x, y;
        cin >> x >> y;
        --x, --y;
        g[x].eb(y);
        g[y].eb(x);
    }

    vi d(n, INF);
    queue<int> q;
    q.emplace(0);
    d[0] = 0;
    while(!empty(q)) {
        int x = q.front();
        q.pop();
        fore(e, g[x]) if(chmin(d[e], d[x] + 1)) q.emplace(e);
    }

    vi cnt(n + 1);
    rep(i, n) {
        if(d[i] <= n) cnt[d[i]]++;
    }
    rep(i, 2, n + 1) cnt[i] += cnt[i - 2];
    rep(i, 1, n + 1) cout << cnt[i] << endl;
}