Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Diverse Permutation

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPermutation *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.

Input

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

Output

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

Examples

Input

3 2

Output

1 3 2

Input

3 1

Output

1 2 3

Input

5 2

Output

1 3 2 4 5

Note

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

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/18/2018 19:21:25 (f1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|