#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int MOD=998244353;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(l);i<(int)(r);i++)

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N,M;
  cin>>N>>M;
  vector G(N,vector(0,0));
  rep(i,M){
    int U,V;
    cin>>U>>V;
    --U,--V;
    G[U].push_back(V),G[V].push_back(U);
  }
  if(G[0].empty()){
    rep(i,N)cout<<"0\n";
    return 0;
  }
  vector ans(N+1,0),dist(N,N+2);
  queue<int>bfs;
  bfs.push(0);
  dist[0]=0;
  while(bfs.size()){
    int v=bfs.front();
    bfs.pop();
    for(auto i:G[v]){
      if(dist[i]>dist[v]+1){
        dist[i]=dist[v]+1;
        bfs.push(i);
      }
    }
  }
  for(auto i:dist)if(i<=N)ans[i]+=1;
  rep(i,N){
    if(i+2<=N)ans[i+2]+=ans[i];
  }
  rep(i,N)cout<<ans[i+1]<<'\n';
}