Problem #1302 - ECNU Online Judge

单点时限: 2.0 sec

内存限制: 256 MB

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: $[a_{1}, a_{2}, \dots, a_{n}]$ is a one-sequence if

for any $k$ , such that $1 \leq k < n$ : $| a_{k} - a_{k + 1} | = 1$ and
$a_{1} = 0$

Write a program that:

reads two integers describing the length of the sequence and the sum of its elements;
finds a one-sequence of the given length whose elements sum up to the given value or
states that such a sequence does not exist.

输入格式

The number of test cases $t$ is in the first line of input, then $t$ test cases follow separated by an empty line.

In the first line of a test case there is a number $n$ , such that $1 \leq n \leq 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 | \leq 50 000 000$ .

输出格式

For each test case there should be written $n$ integers (each integer in a separate line) that are the elements of the sequence ( $k$ -th element in the $k$ -th line) whose sum is $S$ or the word No if such a sequence does not exist. If there is more than one solution your program should output any one.

Consequent test cases should by separated by an empty line.

样例

Input

1
8
4

Output

6 人解决，10 人已尝试。

8 份提交通过，共有 26 份提交。

7.3 EMB 奖励。

创建: 16 年，10 月前.

修改: 7 年，3 月前.

最后提交: 1 年，9 月前.

来源: POI 1998 I Stage

1302. Sum of one-sequence

输入格式

输出格式

样例

服务

开源

关于我们