#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef pair<int, int> P;

signed main(){
    int n, k;
    cin >> n >> k;
    vector<int> d(n, 1);
    d[0] = 1;
    d[1] = 0;
    rep(i, 0, n - k - 2){
        d[i + 2] = d[i] + 1;
    }
    rep(i, 0, k){
        d[n - k + i] = d[n - k - 1];
    }
    rep(i, 0, n){
        if(i != 0) cout << " ";
        cout << d[i];
    }
    cout << endl;
}