In the event of technical difficulties with Szkopuł, please contact us via email at email@example.com.
If you are familiar with IRC chat, the support team is also reachable on PIRC network (
#szkopul channel. If you are not, just use email.
Please do not ask us things like "how to solve task XYZ?".
Please remember that the support team has to sleep sometimes or go to work in real life.
We say that a sequence of integers is a one-sequence if the difference between any two consecutive numbers in this sequence is or and its first element is . More precisely: is a one-sequence if:
Write a program that:
In the first line of the standard input there is a number , such that , which is the number of elements in the sequence. In the second line there is a number , which is the sum of the elements of the sequence, such that .
In the first lines of the standard output there should be written integers (one in each line) that are the elements of the sequence (-th element in the -th line) whose sum is or the word NIE (which means “no” in Polish) if such a sequence does not exist.
For the input data:
the correct result is:
0 1 2 1 0 -1 0 1
Task author: Grzegorz Jakacki.