#include #include #include using namespace std; using namespace atcoder; using mint = modint998244353; #define rep(i,n) for (int i = 0; i < (n); ++i) #define Inf32 1000000001 #define Inf64 4000000000000000001LL int main(){ int n,m; cin>>n>>m; vector d(n,Inf32); vector> E(n); rep(i,m){ int a,b; cin>>a>>b; a--;b--; E[a].push_back(b); E[b].push_back(a); } queue Q; Q.push(0); d[0]=0; while(!Q.empty()){ int v=Q.front(); Q.pop(); for(int u:E[v]){ if(d[u]==Inf32){ d[u]=d[v]+1; Q.push(u); } } } vector ans(n+1,0); rep(i,n){ if(d[i]==Inf32)continue; ans[d[i]]++; } rep(i,n-1)ans[i+2] += ans[i]; for(int i=1;i<=n;i++){ cout<