Rotate or Reverse

Problem Statement

Imagine you have a list of numbers from $1$ to N$.$ Now, let's say you want to group these numbers into segments of K consecutive numbers each. For each segment, you calculate the sum of all its numbers.

The challenge here is to arrange the numbers in such a way that the difference between the highest and lowest segment sum is at most $1.$ This special arrangement is called a K$-$level permutation.

Here are some key points to remember:

Numbers cannot repeat within the permutation $($each number appears only once$).$ K must be even and less than or equal to N

You have N$-$K$+1$ segments to consider. The condition for a K$-$level permutation is: max$($segment sum$)$ min$($segment sum$)<=1.$

Input Format

The first and only line of input contains two integers N and K$.$

Output Format

Display N space$-$separated integers representing the K$-$level permutation.

Finish