#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;

const int mod = 1e9 + 7;
long long calc(long long a, long long b, long long p)
{
	if (b == 0) return 1;
	if (b % 2 == 0)
	{
		long long d = calc(a, b / 2, p);
		return (d * d) % p;
	}
	else
		return (a * calc(a, b - 1, p)) % p;
}
long long nCr(int n, int r) {
  if ( r * 2 > n ) r = n - r;
  long long dividend = 1;
  long long divisor  = 1;
  for (int i = 1; i <= r; ++i ) {
    dividend *= (n-i+1);
	dividend %= mod;
	divisor  *= i;
	divisor %= mod;
  }
  return dividend * calc(divisor, mod - 2, mod) % mod;
}
signed main(void)
{
	long long n, k;
	long long sum, ans;
	cin >> n >> k;
	ans = 0;
	for(int i = k; i <= n; i++)
	{
		if (i % 2 != 0)
			sum = i * (i - 1) / 2;
		else
			sum = i * (i / 2 - 1) + (i / 2);
		ans += (2 * n + 1 - i) * i / 2  - sum + 1;
		cout << sum << endl;
		//ans += (((2 * n + 1 - k) * k)% mod * (2, mod - 2, mod) - n - sum + 1) % mod;
	}
		if ((n + 1) % 2 != 0)
			sum = (n + 1) * n / 2;
		else
			sum = (n + 1) * ((n + 1) / 2 - 1) + ((n + 1) / 2);
	ans += (2 * n + 1 - n) * n / 2  - sum + 1;
	cout << ans << endl;
	return 0;
}
