Description

Given the polynomial equation:

Find all integer solutions of this equation in $[1,m]$ (both $n$ and $m$ are positive integers).

Input Format

The input contains $n + 2$ lines.
The first line contains two integers $n, m$, separated by a single space.
Each of the next $n + 1$ lines contains one integer, namely $a_0, a_1, a_2, \ldots, a_n$ in order.

Output Format

On the first line, output the number of integer solutions in $[1,m]$.
Then output each integer solution in $[1,m]$ in increasing order, one per line.

2 10 
1
-2
1

1
1

2 10
2
-3
1

2
1
2

2 10
1
3
2

0

Hint

For $30\%$ of the testdata: $0<n\le 2,|a_i|\le 100,a_n≠0,m<100$。
For $50\%$ of the testdata: $0<n\le 100,|a_i|\le 10^{100},a_n≠0,m<100$。
For $70\%$ of the testdata: $0<n\le 100,|a_i|\le 10^{10000},a_n≠0,m<10^4$。
For $100\%$ of the testdata: $0<n\le 100,|a_i|\le 10^{10000},a_n≠0,m<10^6$。

Translated by ChatGPT 5