#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

int main() {
    ll N, K;
    cin >> N >> K;

    bool win = N % (K + 1) != 1;

    if (!win) cout << 0 << endl;

    ll a = 0;
    ll b = 0;
    ll curr = 0;
    for (int i = 0;; i++) {
        if (a >= N) break;
        ll g = (K + 1) - (a - b) % (K + 1);
        b = a;
        if (win) {
            if (i % 2 == 0) {
                if (i == 0) {
                    if (N % (K + 1) == 0) {
                        cout << K << endl;
                        a = K;
                    } else {
                        cout << (N % (K + 1)) - 1 << endl;
                        a = (N % (K + 1)) - 1;
                    }
                } else {
                    a += g;
                    cout << a << endl;
                }
            } else {
                cin >> a;
            }
        } else {
            if (i % 2 == 0) {
                cin >> a;
            } else {
                a += g;
                cout << a << endl;
            }
        }
    }
}