#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (1); i <= (b); i++) {
    multiply *= a;
  }
  return multiply;
}
inline long long ABS(long long a) { return (a >= 0) ? a : -a; }
long long n, k, tree[1000007];
long long query(int idx) {
  long long sum = 0;
  while (idx > 0) {
    sum += tree[idx];
    idx -= idx & (-idx);
  }
  return sum;
}
long long calc(int st, int en) {
  if (st == 1) return query(en);
  return query(en) - query(st - 1);
}
void update(int idx, long long x) {
  while (idx <= n) {
    tree[idx] += x;
    idx += idx & (-idx);
  }
}
int main() {
  scanf("%lld %lld", &n, &k);
  memset(tree, 0, sizeof(tree));
  int now = 1, lo, hi;
  long long ans = 1;
  for (int i = (1); i <= (n); i++) {
    if (k <= (n / 2)) {
      lo = now + 1, hi = now + k - 1;
      if (lo > n) lo -= n;
      if (hi > n) hi -= n;
      if (lo > hi)
        ans += calc(lo, n) + calc(1, hi) + 1;
      else
        ans += calc(lo, hi) + 1;
    } else {
      hi = now - 1, lo = now + k + 1;
      if (lo > n) lo -= n;
      if (hi == 0) hi = n;
      if (lo > hi)
        ans += calc(lo, n) + calc(1, hi) + 1;
      else
        ans += calc(lo, hi) + 1;
    }
    printf("%lld ", ans);
    update(now, 1);
    now += k;
    if (now > n) now -= n;
    update(now, 1);
  }
  return 0;
}
