#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define replr(i,l,r) for (ll i=(ll)(l);i<(ll)(r);i++)
#define all(v) v.begin(),v.end()
#define len(v) ((ll)v.size())
template<class T> inline bool chmin(T &a,T b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T &a,T b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
namespace timer{
    auto start=chrono::system_clock::now();
    void snap(){
        start=chrono::system_clock::now();
    }
    int get_ms(){
        auto now=chrono::system_clock::now();
        int ms=chrono::duration_cast<chrono::milliseconds>(now-start).count();
        return ms;
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n,m;
    cin >> n >> m;
    vector<vector<ll>> g(n);
    while(m--){
        ll u,v;
        cin >> u >> v;
        u--;
        v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    vector<ll> c(n,0);
    c[0]=1;
    vector<ll> ans;
    bool ok=false;
    rep(t,n){
        if(1500<timer::get_ms()) break;
        rep(i,n){
            if(c[i]==1) continue;
            for(auto j:g[i]){
                if(c[j]==1) c[i]=2;
            }
        }
        rep(i,n){
            if(c[i]==1) c[i]=0;
        }
        ll now=0;
        rep(i,n){
            if(c[i]==2) c[i]=1;
            if(c[i]==1) now++;
        }
        ans.push_back(now);
        if(3<=t&&ans[t-3]==ans[t-1]&&ans[t-2]==ans[t]){
            ok=true;
            break;
        }
    }
    if(ok||len(ans)==n){
        ll x=ans[len(ans)-2],y=ans[len(ans)-1];
        while(len(ans)<n){
            ans.push_back(x);
            ans.push_back(y);
        }
        rep(i,n) cout << ans[i] << '\n';
        return 0;
    }
    queue<ll> q;
    ans.clear();
    vector<ll> d(n,-1),cnt(n+1,0);
    q.push(0);
    d[0]=0;
    cnt[0]=1;
    while(!q.empty()){
        ll x=q.front();
        q.pop();
        for(auto i:g[x]){
            if(d[i]!=-1) continue;
            d[i]=d[x]+1;
            cnt[d[i]]++;
            q.push(i);
        }
    }
    vector<ll> v(2,0);
    v[0]=1;
    replr(i,1,n+1){
        v[i&1]+=cnt[i];
        cout << v[i&1] << '\n';
    }
}