Given a polynomial
specified by the coefficients a_0, a_1, \ldots, a_{n-1}.
Your task is to compute the value of this polynomial modulo for all integer values of from to , inclusive.
The first line contains integers , , and (1 \le n \le 2000, 1 \le k \le 200\,000, 1 \le m \le 10^9).
The second line contains non-negative integers a_0, a_1, \ldots, a_{n-1}, each not exceeding 10^9 — the coefficients of the polynomial.
Output k+1 integers: the remainders of P(0), P(1), \ldots, P(k) when divided by . Output the numbers in increasing order of , separated by spaces.
Example 1