A. Diverse Permutationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPermutation p is an ordered set of integers p1,   p2,   ...,   pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1,   p2,   ...,   pn.Your task is to find such permutation p of length n, that the group of numbers |p1 - p2|, |p2 - p3|, ..., |pn - 1 - pn| has exactly k distinct elements.InputThe single line of the input contains two space-separated positive integers n, k (1 ≤ k < n ≤ 105).OutputPrint n integers forming the permutation. If there are multiple answers, print any of them.ExamplesInput3 2Output1 3 2Input3 1Output1 2 3Input5 2Output1 3 2 4 5NoteBy |x| we denote the absolute value of number x. 
Input3 2
Output1 3 2
['constructive algorithms', 'greedy', '*1200']