## MPOLEVAL - Polynomial Evaluation - Angry Teacher

English | Vietnamese |

Mr. O'Cruel is teaching Math to ninth grade students. Students of course are very lazy, so they do not like to do their homework. On the other side, Mr. O'Cruel doesn't like lazy students.Recently Andrew failed to do his homework again, so he was given a special task. If he doesn't do it, he will be expelled from his school. The task seems very easy, but it is very technical, so it would take a lot of time. Andrew is given a polynomial p(x) = anxn + an-1xn-1 + . . . + a1x + a0 with integer coefficients.

He must calculate the value of the polynomial for k successive integer numbers starting from l. Of course writing all these numbers would require too much paper. So as a proof of completing the task, for each number x from l to l + k - 1 Andrew is asked to provide the sum of squares of m last digits in decimal notation of p(x). Since Andrew is lazy, he doesn't want to do the task by himself. So he asks you to write the program that calculates the values requested.

### Input

The first line of the input file contains n, l, k, and m (0 <= n <= 10, 0 <= l <= 10^1000 , 1 <= k <= 1 000, 1 <= m <= 1 000). The following n + 1 lines contain coefficients of the polynomial: an , an-1 , . . . , a1 , a0 (0 <= ai <= 10^1000).

SAMPLE INPUT

3 0 10 2

1

0

2

1

### Output

Output k lines --- for x from l to l + k - 1 output the sum of squares of last m digits of p(x).

SAMPLE OUTPUT

1

16

10

25

58

45

85

89

85

80

Added by: | ~!(*(@*!@^& |

Date: | 2009-02-24 |

Time limit: | 0.125s-0.629s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | ADA95 ASM32 BASH BF C CSHARP CPP C99 CLPS LISP sbcl LISP clisp D FORTRAN HASK ICON ICK JAVA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON RUBY SCM qobi SCM guile ST WHITESPACE |

Resource: | Northeastern Europe 2004 Northern Subregion |