#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    ll n,m;cin>>n>>m;
    vector<vector<ll>>g(n);
    for(int i=0;i<m;i++)
    {
        ll u,v;cin>>u>>v;
        u--;v--;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    queue<ll>que;
    vector<ll>dist(n,-1),cnt(n+1),ans(2);
    que.push(0);
    dist[0]=0;
    while(!que.empty())
    {
        ll now=que.front();
        que.pop();
        for(ll nex:g[now])
        {
            if(dist[nex]!=-1)continue;
            dist[nex]=dist[now]+1;
            que.push(nex);
        }
    }
    for(int i=0;i<n;i++)if(dist[i]!=-1)cnt[dist[i]]++;
    ans[0]+=cnt[0];
    for(int i=1;i<=n;i++)
    {
        ans[i%2]+=cnt[i];
        cout<<ans[i%2]<<endl;
    }
}