#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

int N, K;
int W[4] = { 1,3,2,4 };

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

	int w = N - K - 2;

	if (w == 0) {
		for (int i = 0; i < N; i++) {
			cout << i + 1;
			if (i != N - 1)cout << " ";
		}
	}
	else {
		int i,j;
		for (i = 0,j=0; j < 2 + w; i++,j++) {
			cout << W[i];
			if (j != N - 1)cout << " ";
			if (i >= 3)i = -1;
		}
		if (i == 0)i = 4;
		for (int k = W[i-1],l=j; l < N; k++,l++) {
			cout << k;
			if (l != N - 1)cout << " ";
		}
	}
	cout << endl;
	return 0;
}