Generalized Fibonacci Chipmunks#5432
As you may know, chipmunks live for years. Chipmunks are affectionate creatures, so every year new chipmunks are born among them. Specifically, if in some place in year there are exactly chipmunks, then in year y + 1 an additional chipmunks will be born.
A wildlife researcher is cataloguing a colony of chipmunks. On the first day of observation, the researcher notices that there are exactly n_1 chipmunks aged year, n_2 chipmunks aged years, and so on.
Now the researcher wants to know how many chipmunks there will be after years. Since large numbers can be impractical, report the answer modulo .
The first line contains the integer (1 \leq a \leq 5) — the lifetime of the chipmunks (in years).
The second line contains non-negative integers n_1, n_2, \ldots, n_a (0 \leq n_i \leq 100) — the number of chipmunks aged , , , years, respectively.
The third line contains two integers and (0 \leq k \leq 10^9, 1 < m \leq 10^9) — the number of years after which to compute the answer, and the modulo.
Print the number of chipmunks after years, modulo .
Example 1