5541: Pty loves sequence

The first line contains a single integer T(1 ≤ T ≤ 10) — the number of test cases. 
For each test case, only one line contains two integers n, p (1 ≤ n ≤ 3000, 1 ≤ p ≤ 10e9 ).

For each test case, output two lines. 
The first line contains a integer - the number of good suquences modulo p. The second line contains n integers separated by spaces - The x-th integer represent the occurrence number of x in all good sequences modulo p. 

2
3 3
3 1216

0
1 1 1
6
10 7 1