Problem: Rebel spy Heidi has just obtained the plans for the Death Star from the Empire and, now on her way to safety, she is trying to break the encryption of the plans (of course they are encrypted – the Empire may be evil, but it is not stupid!). The encryption has several levels of security, and here is how the first one looks.

Heidi is presented with a screen that shows her a sequence of integers A and a positive integer p. She knows that the encryption code is a single number S, which is defined as follows:

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 an integer p. She needs to split A into 2 parts such that: 

  * Each part contains at least 1 element of A, and each part consists of contiguous elements of A. 
  * The two parts do not overlap. 
  * The total sum S of the scores of those two parts is maximized. This is the encryption code. 



Output the sum S, which is the encryption code.

Input

The first line of the input contains two space-separated integer N and p (2 ≤ N ≤ 100 000, 2 ≤ p ≤ 10 000) – the number of elements in A, and the modulo for computing scores, respectively.

The second line contains N space-separated integers which 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 10
3 4 7 2


Output

16


Input

10 12
16 3 24 13 9 8 7 5 12 12


Output

13

Note

In the first example, the score is maximized if the input sequence is split into two parts as (3, 4), (7, 2). It gives the total score of <image>.

In the second example, the score is maximized if the first part consists of the first three elements, and the second part consists of the rest. Then, the score is <image>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510000;
const int maxk = 105;
const int maxp = 105;
int n, K, P;
int a[maxn], sum[maxn];
int nex[maxp][maxn];
int f[maxk][maxk * maxp];
vector<int> V[maxn];
void upd(int &x, int y) {
  if (x == -1 || x > y) x = y;
}
int main() {
  scanf("%d%d%d", &n, &K, &P);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i] %= P;
    sum[i] = (sum[i - 1] + a[i]) % P;
  }
  for (int i = 1; i <= n; i++) V[sum[i]].push_back(i);
  for (int i = 0; i < P; i++) {
    nex[i][0] = !(int)V[i].size() ? -1 : 0;
    for (int j = 1; j <= n; j++) {
      int k = nex[i][j - 1];
      if (k == -1 || (int)V[i][k] >= j)
        nex[i][j] = k;
      else {
        if (k < (int)V[i].size() - 1)
          k++;
        else
          k = -1;
        nex[i][j] = k;
      }
    }
  }
  memset(f, -1, sizeof f);
  f[0][0] = 0;
  for (int i = 1; i < K; i++) {
    int uj = (i - 1) * (P - 1);
    for (int j = 0; j <= uj; j++)
      if (f[i - 1][j] != -1 && f[i - 1][j] != n) {
        for (int k = 0; k < P; k++)
          if (nex[k][f[i - 1][j] + 1] != -1) {
            int tx = nex[k][f[i - 1][j] + 1],
                cc = (k - sum[f[i - 1][j]] + P) % P;
            upd(f[i][j + cc], V[k][tx]);
          }
      }
  }
  int ans = K * P;
  for (int i = 0; i <= (K - 1) * (P - 1); i++)
    if (f[K - 1][i] != -1 && f[K - 1][i] < n)
      ans = min(ans, i + (sum[n] - sum[f[K - 1][i]] + P) % P);
  printf("%d\n", ans);
  return 0;
}