#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,int> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

int main(){
    int N,M;
    cin>>N>>M;
    vector<vector<int>> G(N);
    for(int i=0;i<M;i++){
        int u,v;
        cin>>u>>v;
        u--;v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    priority_queue<P,vector<P>,greater<P>> pq;
    vector<int> dist(N,inf);
    pq.push(P{0,0});//距離,頂点

    while(!pq.empty()){
        auto [d,v]=pq.top();
        pq.pop();
        if(dist[v]<=d) continue;
        dist[v]=d;
        for(auto nv:G[v]){
            if(dist[nv]>d+1){
                pq.push(P{d+1,nv});
            }
        }
    }
    vector<int> cnt(N+1,0);//0~N
    for(int i=0;i<N;i++){
        if(dist[i]==inf) continue;
        cnt[dist[i]]++;
    }

    for(int i=2;i<=N;i++){
        cnt[i]+=cnt[i-2];
    }
    for(int i=1;i<=N;i++){
        cout<<cnt[i]<<endl;
    }



    

}