#include <iostream>
#include <algorithm>
using namespace std;
int N, W, s[200009];
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> N >> W;
	int ret = 0;
	for (int i = W / 2 + 1; i < W; i++) {
		for (int j = 2 * i - W + 1, k = 1; j <= N - W + 1 || k == 1; j += i, k++) {
			int l = j, r = j + W - i;
			if (j == 2 * i - W + 1) l = 1;
			s[l]++, s[r]--;
		}
	}
	for (int i = 1; i <= N - W + 1; i++) {
		if (i >= 2) cout << ' ';
		s[i] += s[i - 1];
		cout << s[i] + W / 2 + min(i, W);
	}
	cout << "\n";
	return 0;
}
