# The Exam

### Memory limit: 128 MB

Professor Byteoni is preparing *Bit & Byte Theory* exam. He has already prepared questions. Each of these questions has been ranked with an expected difficulty coefficient by the professor. This coefficient is a natural number ranging from 1 to . Each of the questions holds a different coefficient.

Now the professor is considering the exam questions sequence. Professor wishes to determine whether his students are able to judge the question difficulty by themselves. For this purpose he plans to line up his questions in such a way, that coefficients of subsequent questions differ at least by . Help the professor to find such a sequence.

## Input

The first and only input line contains two integers and (, ): the number of questions prepared by professor and the lower limit of the difficulty difference of subsequent exam questions.

## Output

Your program should output one line containing sought question difficulty coefficients sequence, in other words a sequence of pairwise distinct natural numbers ranging from 1 to , where each two subsequent numbers differ at least by . If there are numerous correct answers, your program should write any one of these. In case the sought sequence does not exist, your program should write only one word: `NIE` (Polish for *no*).

## Example

For the following input data:

5 2

one of the correct results is:

2 4 1 5 3

whereas for the following input data:

5 4

the correct result is:

NIE

*Task author: Jakub Łącki*