//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler

#include <stdio.h>

#include <iostream>

#include <cstring>

#include <cmath>

#include <stack>

#include <queue>

#include <vector>

#include <algorithm>

#define ll long long

#define Max(a,b) (((a) > (b)) ? (a) : (b))

#define Min(a,b) (((a) < (b)) ? (a) : (b))

#define Abs(x) (((x) > 0) ? (x) : (-(x)))

using namespace std;

const int INF = 0x3f3f3f3f;

int a[];

int main(){

    int i, j, k, t, m, n;

    while(EOF != scanf("%d%d",&n,&k)){

        if(k == ){

            for(i = ; i < n; ++i)  printf("%d ",i);

            printf("%d\n",n);

            continue;

        }

        a[] =  + k;

        for(i = ; i <= k + ; ++i){

            if(i %  == )

                a[i] = a[i - ] - (k - (i - ));

            else

                a[i] = a[i - ] + (k - (i - ));

        }

        int cur = ;

        for(i = k + ; i <= n; ++i){

            a[i] = k +  + cur++;

        }

        for(i = ; i < n; ++i){

            printf("%d ",a[i]);

        }

        printf("%d\n",a[n]);

    }

    return ;

}