CF359B Permutation

A permutation $ p $ is an ordered group of numbers $ p_{1},p_{2},...,p_{n} $ , consisting of $ n $ distinct positive integers, each is no more than $ n $ . We'll define number $ n $ as the length of permutation $ p_{1},p_{2},...,p_{n} $ . Simon has a positive integer $ n $ and a non-negative integer $ k $ , such that $ 2k

The first line contains two integers $ n $ and $ k $ ( $ 1

Print $ 2n $ integers $ a_{1},a_{2},...,a_{2n} $ — the required permutation $ a $ . It is guaranteed that the solution exists. If there are multiple solutions, you can print any of them.

Record $ |x| $ represents the absolute value of number $ x $ . In the first sample $ |1-2|-|1-2|=0 $ . In the second sample $ |3-2|+|1-4|-|3-2+1-4|=1+3-2=2 $ . In the third sample $ |2-7|+|4-6|+|1-3|+|5-8|-|2-7+4-6+1-3+5-8|=12-12=0 $ .