#include <bits/stdc++.h>
using namespace std;
long long int solve() {
  long long int n, k, p;
  cin >> n >> k >> p;
  vector<long long int> v;
  for (long long int j = 0; j < n; j++) {
    long long int c;
    cin >> c;
    v.push_back(c);
  }
  vector<long long int> pref;
  pref.push_back(v[0]);
  for (long long int j = 1; j < n; j++) {
    pref.push_back(v[j] + pref[j - 1]);
  }
  vector<vector<long long int>> dp(n, vector<long long int>(k + 1, 0));
  vector<vector<long long int>> m(k + 1, vector<long long int>(p, -1));
  dp[0][1] = v[0] % p;
  m[1][v[0] % p] = 0;
  for (long long int i = 1; i < n; i++) {
    dp[i][1] = pref[i] % p;
    for (long long int l = 2; l <= min(k, i + 1); l++) {
      for (long long int j = 0; j < p; j++) {
        if (pref[i] % p < j && m[l - 1][j] != -1) {
          dp[i][l] = max(dp[i][l], p + (pref[i] % p) + m[l - 1][j]);
        } else if (pref[i] % p >= j && m[l - 1][j] != -1) {
          dp[i][l] = max(dp[i][l], pref[i] % p + m[l - 1][j]);
        }
      }
    }
    for (long long int l = 1; l <= min(k, i + 1); l++) {
      m[l][pref[i] % p] = max(m[l][pref[i] % p], dp[i][l] - (pref[i] % p));
    }
  }
  cout << dp[n - 1][k] << "\n";
  return 0;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
