n, k = map(int, input().split())
# 正解門松列数
k = n - k - 2

# sigh関数
sigh = lambda x: [1, -1][x%2]

for i in range(n):
    if i < k + 2:
        s = n + sigh(i)*((i+1)//2)
    else:
    	s = s + sigh(k+1)
    print(s, end=' ')
print()