#include <bits/stdc++.h>
long long int gcd(long long int a, long long int b) {
  return (a ? gcd(b % a, a) : b);
}
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n >> b) & 1; }
inline void set_bit(int& n, int b) { n |= two(b); }
inline void unset_bit(int& n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
long long int modPow(long long int a, long long int b, long long int MOD) {
  long long int x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y) % MOD;
    }
    b /= 2;
    y = (y * y) % MOD;
  }
  return x;
}
long long int modInverse(long long int a, long long int p) {
  return modPow(a, p - 2, p);
}
using namespace std;
int main() {
  int n, k, i, from, to;
  long long int crossed_count, ans;
  crossed_count = 0;
  ans = 1;
  scanf("%d", &n);
  scanf("%d", &k);
  k = min(k, n - k);
  from = 0;
  for (int i = (1); i <= (n); i++) {
    to = (from + k) % n;
    if (to < from && to != 0) crossed_count++;
    ans += crossed_count + 1;
    if (to < from) crossed_count++;
    printf("%lld ", ans);
    from = to;
  }
  return 0;
}
