n,k=map(int,input().split())
l=[]
x=n
y=1
for i in range(k):
if i%2==0:
l.append(x)
x-=1
else:
l.append(y)
y+=1
low=0
t=0
if k%2==0:
low=y
t=1
else:
low=x
t=-1
for i in range(n-k):
l.append(low)
low+=t
for i in l:
print(i,end=" ")#include <bits/stdc++.h>
using namespace std;
int main()
{
cin.sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int l = 1, r = n;
int i = 0;
while (k>1)
{
if (i%2==0) cout << l++ << ' ';
else cout << r-- << ' ';
k--;
i++;
}
if (i%2==0)
{
while (l<=r) cout << l++ << ' ';
}
else while (r>=l) cout << r-- << ' ';
return 0;
}/*1698101581.4531465*/HRDSEQ Hard Sequence | DRCHEF Doctor Chef |
559. Maximum Depth of N-ary Tree | 821. Shortest Distance to a Character |
1441. Build an Array With Stack Operations | 1356. Sort Integers by The Number of 1 Bits |
922. Sort Array By Parity II | 344. Reverse String |
1047. Remove All Adjacent Duplicates In String | 977. Squares of a Sorted Array |
852. Peak Index in a Mountain Array | 461. Hamming Distance |
1748. Sum of Unique Elements | 897. Increasing Order Search Tree |
905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |
832. Flipping an Image | 1295. Find Numbers with Even Number of Digits |