#include <bits/stdc++.h>
//#define int long long
#define endl '\n'
#define fr(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define br(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
using namespace std;
const int N = 1e6 + 10 ;
int a[N];
int ans[N];
int cnt;
inline void solve()
{
    int n, k;
    cin >> n >> k;
    if (k == 1)
    {
        for (int i = 1; i <= n - 1; i++)
            cout << i << " ";
        cout << n;
        return;
    }
    fr(i, 1, n)
    {
        if(cnt >= n)
            break;
        if (a[i])
            continue;
        ans[++cnt] = i;
        a[i] = 1;
        int tem = i;
        while (tem + k <= n)
        {
            if(a[tem + k])
            {
                tem += k;
                continue;
            }
            ans[++cnt] = tem + k;
            tem += k;
            a[tem + k] = 1;
        }
    }
    for (int i = 1; i <= n - 1; i++)
    {
        cout << ans[i] << ' ';
    }
    cout << ans[n];
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    //   cin >> T;
    while (T--)
    {
        solve();
    }
}