#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;
}
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;
    rep(_,100){
        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);
    }
    ll x=ans[98],y=ans[99];
    while(len(ans)<n){
        ans.push_back(x);
        ans.push_back(y);
    }
    rep(i,n) cout << ans[i] << '\n';
}