#include <bits/stdc++.h>
using namespace std;
const int maxn = 210, INF = 0x3f3f3f3f;
template <typename Tp>
inline int getmin(Tp &x, Tp y) {
  return y < x ? x = y, 1 : 0;
}
template <typename Tp>
inline int getmax(Tp &x, Tp y) {
  return y > x ? x = y, 1 : 0;
}
template <typename Tp>
inline void read(Tp &x) {
  x = 0;
  int f = 0;
  char ch = getchar();
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') f = 1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  if (f) x = -x;
}
int n, k, mod, mx, a[1000010], sum[1000010], cnt[maxn], rk[maxn],
    f[maxn][40010];
struct BIT {
  int a[maxn];
  BIT() { memset(a, 0x3f, sizeof(a)); }
  void update(int p, int v) {
    ++p;
    for (; p <= mod; p += ((p) & (-(p)))) getmin(a[p], v);
  }
  int query(int p) {
    int res = INF;
    ++p;
    for (; p > 0; p -= ((p) & (-(p)))) getmin(res, a[p]);
    return res;
  }
} L[maxn], R[maxn];
inline int pls(int x, int y) { return x + y >= mod ? x + y - mod : x + y; }
int lis() {
  memset(rk, 0x3f, sizeof(rk));
  for (register int i = 1; i <= n; i++)
    *upper_bound(rk + 1, rk + k + 1, sum[i]) = sum[i];
  return rk[k] <= sum[n];
}
void dp() {
  memset(f, 0x3f, sizeof(f));
  L[0].update(0, 0);
  for (register int j = 1; j <= n; j++)
    for (register int i = k; i; i--) {
      getmin(f[i][j], L[i - 1].query(sum[j]) + sum[j]);
      getmin(f[i][j], R[i - 1].query(mod - sum[j]) + sum[j] + mod);
      L[i].update(sum[j], f[i][j] - sum[j]);
      R[i].update(mod - sum[j], f[i][j] - sum[j]);
    }
  printf("%d\n", f[k][n]);
}
int main() {
  read(n);
  read(k);
  read(mod);
  if (k > n) {
    printf("%d\n", INF);
    return 0;
  }
  for (register int i = 1; i <= n; i++) {
    read(a[i]);
    sum[i] = (sum[i - 1] + a[i]) % mod;
    ++cnt[sum[i]];
    getmax(mx, cnt[sum[i]]);
  }
  if (lis())
    printf("%d\n", sum[n]);
  else if (n > k * mod)
    printf("%d\n", sum[n] + mod);
  else
    dp();
  return 0;
}
