#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)

int calc(vector<int> v) {
    int c = 0;
    rep(i, SZ(v)) {
        if (v[i] > v[i + 1] && v[i + 2] > v[i + 1]) c++;
        if (v[i] < v[i + 1] && v[i + 2] < v[i + 1]) c++;
    }
    return c;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // 数列の値は0以上10^9以下
    int n, k;
    cin >> n >> k;
    k = n - k - 2;
    vector<int> v;
    v.eb(500000000);
    v.eb(500000001);
    rep3(i, 2, k + 2) { if (i % 2 == 0) v.eb(v[i - 2] - 1); else v.eb(v[i - 2] + 1); }
    int a = v[SZ(v) - 1];
    rep(i, n - k - 2) v.eb(a);
    outa(v, SZ(v));
    // out(calc(v));
}