#include <bits/stdc++.h> 
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 #define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)

ll INF=2e18;


int main() {
    ios::sync_with_stdio(false);
  cin.tie(0);

ll N,M;
cin>>N>>M;

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

vector<ll> d(N,INF);
d[0]=0;

queue<ll> S;
S.push(0);

while(!S.empty()) {
  auto s=S.front();
  S.pop();

  for(auto x:vec[s]) {
    if(d[x]==INF) {
      d[x]=d[s]+1;
      S.push(x);
    }
  }
}

vector<ll> cnt(N+1);
for(ll i=0;i<N;i++) {
  if(d[i]==INF) continue;
  cnt[d[i]]++;
}

ll g=1;
ll k=0;


for(ll i=1;i<=N;i++) {
  if(i%2==0) {
    g+=cnt[i];
    cout<<g<<endl;
  }
  else {
    k+=cnt[i];
    cout<<k<<endl;
  }
}

}