|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||128 MB||40||23||18||54.545%|
We say that a sequence of integers is a one-sequence if the difference between any two consecutive numbers in this sequence is 1 or -1 and its first element is 0. More precisely: [a1, a2, ..., an] is a one-sequence if:
Write a program that:
In the first line of the standard input there is a number n, such that 1 ≤ n ≤ 10,000, which is the number of elements in the sequence. In the second line there is a number S, which is the sum of the elements of the sequence, such that |S| ≤ 50,000,000.
In the first n lines of the standard output there should be written n integers (one in each line) that are the elements of the sequence (k-th element in the k-th line) whose sum is S or the word
NIE (which means “no” in Polish) if such a sequence does not exist.
0 1 2 1 0 -1 0 1