#include<iostream>
using namespace std; 
#define MAXN 120

long long n, m, a[MAXN], ans = 0;

void dfs(int x, int step, int tmp, int maxn) {
	if(step > m) return;
	if(x > n) {
		if(step == m && maxn <= m) a[maxn] ++;
		return;
	}
	dfs(x + 1, step, 0, maxn);
	tmp ++; maxn = max(maxn, tmp);
	dfs(x + 1, step + 1, tmp, maxn);
	return;
}

int main() {
	freopen("combos.in", "r", stdin);
	freopen("combos.out", "w", stdout);
	
	cin >> n >> m;
	if(m == 1) { cout << n << "\n"; return 0; }
	if(n == 1) { for(int i = 1; i <= m; i ++) cout << 0 << "\n"; return 0; }
	if(n == m) { for(int i = 1; i < m; i ++) cout << 0 << "\n"; cout << 1 << "\n"; return 0; }
	dfs(1, 0, 0, 0);
	for(int i = 1; i <= m; i ++) cout << a[i] << "\n";
	return 0;
}