#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    // 2 3 1 4 2 3 1 4 ...
    int n,k; cin >> n >> k;
    int x[] = {2, 3, 1, 4};
    vector<int> a = {1, 4};
    for(int i = 0; int(a.size()) < n - k; i = (i + 1) % 4) a.push_back(x[i]);
    while(int(a.size()) < n) a.push_back(a.back());

    auto cnt = [](vector<int> a) {
        int n = a.size();
        int p = 0;
        rep(i,n-2) {
            auto [mi, ma] = minmax({a[i], a[i + 1], a[i + 2]});
            if(a[i] != a[i + 1] && a[i + 1] != a[i + 2] && a[i + 2] != a[i] && (mi == a[i + 1] || ma == a[i + 1])) p++;
        }
        return p;
    };

    assert(int(a.size()) == n);
    assert(cnt(a) == n - k - 2);

    rep(i,n) cout << a[i] << " \n"[i == n - 1];
}