#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010


int main(){
  int n,k;

  cin >> n >> k;

  int c = n-k-2;
  int last = 1;

  printf("%d %d",5000000,5000000+1);
  
  for(int i=2;i<n;i++){
    if(c > 0){
      c--;
      if(i%2 == 0){
        printf(" %d",5000000-i);
        last = -1;
      }else{
        printf(" %d",5000000+i);
        last = 1;
      }
    }else{
      if(last == 1){
        printf(" %d",5000000+i);
      }else{
        printf(" %d",5000000-i);
      }        
    } 
  }
  
  printf("\n");
  
  return 0;
}