#include <bits/stdc++.h>
using namespace std;
int a[100010];
int n, k;
void shuchu() {
  for (int i = 1; i <= 2 * n; i++) {
    if (i != 1) printf(" ");
    printf("%d", a[i]);
  }
  printf("\n");
  return;
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= 2 * n; i++) a[i] = i;
  if (n == 1) {
    printf("1 2\n");
    return 0;
  }
  if (n == 3 && k == 3) {
    printf("1 4 3 6 5 2\n");
    return 0;
  }
  if (k & 1) {
    if (k == n) {
      int keng = n / 2;
      if (keng & 1) {
        int diq = k / 2 + 2;
        int dih = k * 2 + 1 - diq;
        swap(a[diq], a[dih]);
        swap(a[diq], a[diq + 1]);
        swap(a[1], a[2]);
        swap(a[k * 2 - 1], a[k * 2 - 2]);
        swap(a[k * 2], a[k * 2 - 1]);
        shuchu();
        return 0;
      } else {
        int diq = k / 2 + 1;
        int dih = k * 2 + 1 - diq;
        swap(a[diq], a[dih]);
        swap(a[diq], a[diq + 1]);
        swap(a[1], a[2]);
        shuchu();
        return 0;
      }
    }
    int huan = k / 2;
    for (int i = 2; huan > 0; i += 4, huan--) {
      swap(a[i], a[i + 1]);
      swap(a[i - 1], a[i]);
    }
    huan = k / 2;
    int ji = huan * 4 + 1;
    swap(a[ji], a[ji + 1]);
    shuchu();
    return 0;
  } else {
    int huan = k / 2;
    for (int i = 2; huan > 0; i += 4, huan--) {
      swap(a[i], a[i + 1]);
      swap(a[i - 1], a[i]);
    }
    shuchu();
    return 0;
  }
}
