#include <bits/stdc++.h>
using namespace std;
struct __s {
  __s() {
    if (1) {
      ios_base::Init i;
      cin.sync_with_stdio(0);
      cin.tie(0);
    }
  }
  ~__s() {
    if (!1)
      fprintf(stderr, "Execution time: %.3lf s.\n",
              (double)clock() / CLOCKS_PER_SEC);
    int n;
    cin >> n;
  }
} __S;
int a[21111];
int s[21111];
int dp[55][21111];
vector<int> p[55];
bool u[55][5111];
int getS(int l, int r) {
  int res = s[r];
  if (l) res -= s[l - 1];
  return res;
}
int main(void) {
  int n, k, mod;
  cin >> n >> k >> mod;
  for (int i = 0; i < (int)(n); i++) {
    cin >> a[i];
    a[i] %= mod;
    s[i] = a[i];
  }
  for (int i = 0; i < (int)(n); i++) {
    s[i + 1] += s[i];
  }
  dp[1][0] = a[0];
  p[1].push_back(0);
  u[1][dp[1][0]] = true;
  for (int i = 1; i < n; i++) {
    dp[1][i] = dp[1][i - 1] + a[i];
    dp[1][i] %= mod;
    if (!u[1][dp[1][i]]) {
      p[1].push_back(i);
      u[1][dp[1][i]] = true;
    }
  }
  sort(p[1].begin(), p[1].end());
  for (int i = 2; i <= k; i++) {
    for (int j = 0; j < (int)(n); j++) {
      for (int l : p[i - 1]) {
        if (l >= j) break;
        int sum = getS(l + 1, j) % mod;
        dp[i][j] = max(dp[i][j], dp[i - 1][l] + sum);
      }
      if (!u[i][dp[i][j]]) {
        p[i].push_back(j);
        u[i][dp[i][j]] = true;
      }
    }
    sort(p[i].begin(), p[i].end());
  }
  cout << dp[k][n - 1] << '\n';
  return 0;
}
