#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 1e6 + 5;
int ans[N];
void solve() {
    int n;
    int k = 0;
    cin >> n >> k;

    ll tmp = 1;
    ll bon = 0;
    for (int i = 1; i <= n; ++i) {
        ans[i] = tmp + bon;
        bon += k;
        if (tmp + bon > n) {
            ++tmp;
            bon = 0;
        }
    }

    for (int i = 1; i <= n; ++i) {
        cout << ans[i] << " \n"[i == n];
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n = 1;
    while (n--)
        solve();
    return 0;
}