#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n,m;
    cin >> n >> m;
    vector<vector<int>> g(n);
    rep(i,m){
        int u, v;
        cin >> u >> v;
        --u;--v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<int> dist(n, 1e9);
    queue<int> q;
    dist[0] = 0;
    q.push(0);
    while(!q.empty()) {
        int u = q.front();q.pop();
        for(int v : g[u]) {
            if(dist[v]==1e9) {
                dist[v] = dist[u] + 1;
                q.push(v);
            }
        }
    }
    int even = 1;
    int odd = 0;
    vector<int> d(n+2);
    rep(i,n) {
        if(dist[i]==1e9) continue;
        d[dist[i]]++;
    }
    dbg(d);
    if(g[0].size()==0) {
        rep(i,n) {
            cout << 0 << endl;
        }
        return 0;
    }
    rep(i,n) {
        if(i%2==0) {
            odd += d[i+1];
            cout << odd << endl;
        }
        else{
            even += d[i+1];
            cout << even << endl;
        }
    }
    return 0;
}