#include<string>
#include<iostream>
#include<algorithm>
#include<set>
#include<unordered_set>
#include<math.h>
#include<vector>
#include<sstream>
#include<queue>
#include<functional>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include <cstring>
#include <climits>
using namespace std;
#define rep(i,n) for(int (i)=0;(i) < (n); (i)++)
#define FIND(v, k) find((v).begin(), (v).end(), k)
#define MAX 101
#define MAX_V 15
#define mset(a,x) memset(a,x,sizeof(a))
int main() {
	int n, k;
	cin >> n >> k;
	if (k == 0) {
		int kd[] = { 1, 3, 2, 4 };
		rep(i, n) {
			if (i) cout << " ";
			cout << kd[i % 4];
		}
		cout << endl;
	}
	else {
		int m = n - k - 2;
		int ls = 0;
		if (m == 0) {
			rep(i, n) {
				if (i) cout << " ";
				cout << 1;
			}
			cout << endl;
		}
		else {
			int kd[] = { 1, 3, 2, 4 };
			rep(i, m + 2) {
				if (i) cout << " ";
				ls = kd[i % 4];
				cout << ls;
			}
			rep(i, n - m - 2) {
				cout << " ";
				cout << ls;
			}
			cout << endl;
		}
	}
	return 0;
}