Diverse Permutation

## 题面翻译 构造一个 $n$ 的排列，使得 $|a_i-a_{i+1}|\ (1\leq i<n)$ 恰有 $k$ 个不同的值。 本题有 Special Judge。 ## 输入格式 仅一行两个整数 $n,k$。 ## 输出格式 符合题意的一个 $n$ 的排列。如有多组答案，输出任意一组。 翻译贡献者：尘染梦 题面修改：[Hszzzx](/user/676412) ## 说明/提示 $1\leq k < n \leq 10^5$.

Permutation $ p $ is an ordered set of integers $ p_{1},p_{2},...,p_{n} $ , consisting of $ n $ distinct positive integers not larger than $ n $ . We'll denote as $ n $ the length of permutation $ p_{1},p_{2},...,p_{n} $ . Your task is to find such permutation $ p $ of length $ n $ , that the group of numbers $ |p_{1}-p_{2}|,|p_{2}-p_{3}|,...,|p_{n-1}-p_{n}| $ has exactly $ k $ distinct elements.

The single line of the input contains two space-separated positive integers $ n $ , $ k $ ( $ 1<=k<n<=10^{5} $ ).

Print $ n $ integers forming the permutation. If there are multiple answers, print any of them.

3 2

1 3 2

3 1

1 2 3

5 2

1 3 2 4 5

By $ |x| $ we denote the absolute value of number $ x $ .