Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C3. Encryption (hard)

time limit per test

2.2 secondsmemory limit per test

512 megabytesinput

standard inputoutput

standard outputHeidi is now just one code away from breaking the encryption of the Death Star plans. The screen that should be presenting her with the description of the next code looks almost like the previous one, though who would have thought that the evil Empire engineers would fill this small screen with several million digits! It is just ridiculous to think that anyone would read them all...

Heidi is once again given a sequence *A* and two integers *k* and *p*. She needs to find out what the encryption key *S* is.

Let *X* be a sequence of integers, and *p* a positive integer. We define the score of *X* to be the sum of the elements of *X* modulo *p*.

Heidi is given a sequence *A* that consists of *N* integers, and also given integers *k* and *p*. Her goal is to split *A* into *k* parts such that:

- Each part contains at least 1 element of
*A*, and each part consists of contiguous elements of*A*. - No two parts overlap.
- The total sum
*S*of the scores of those parts is minimized (not maximized!).

Output the sum *S*, which is the encryption code.

Input

The first line of the input contains three space-separated integers *N*, *k* and *p* (*k* ≤ *N* ≤ 500 000, 2 ≤ *k* ≤ 100, 2 ≤ *p* ≤ 100) – the number of elements in *A*, the number of parts *A* should be split into, and the modulo for computing scores, respectively.

The second line contains *N* space-separated integers that are the elements of *A*. Each integer is from the interval [1, 1 000 000].

Output

Output the number *S* as described in the problem statement.

Examples

Input

4 3 10

3 4 7 2

Output

6

Input

10 5 12

16 3 24 13 9 8 7 5 12 12

Output

13

Note

In the first example, if the input sequence is split as (3), (4, 7), (2), the total score would be . It is easy to see that this score is the smallest possible.

In the second example, one possible way to obtain score 13 is to make the following split: (16, 3), (24), (13), (9, 8), (7, 5, 12, 12).

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/27/2021 16:17:34 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|