#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m;
ll C[103][103],a[103];
void dfs(int i,int cnt1,int tmp,int maxx){                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   
	if(cnt1>m){
		return;
	}
	if(i>n){
		if(cnt1==m&&maxx<=m){
			a[maxx]+=1LL;
		}
		return;
	}
	dfs(i+1,cnt1,0,maxx); 
	tmp+=1;
	maxx=max(tmp,maxx);
	dfs(i+1,cnt1+1,tmp,maxx);
	return;
}
int main(){
	freopen("combos.in","r",stdin);
	freopen("combos.out","w",stdout);
	scanf("%d%d",&n,&m);
	if(n==m){
		for(int i=1;i<n;i++){
			cout<<"0\n";
		}
		cout<<"1\n";
	}else if(m==1){
		cout<<n<<"\n";
	}else if(n==1){
		for(int i=1;i<=m;i++){
			cout<<"0\n";
		}
	}else{
		dfs(1,0,0,0);
		for(int i=1;i<=m;i++){
			cout<<a[i]<<"\n"; 
		}		
	}
	return 0;
}