#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<pair<long long int, long long int>,
                             pair<long long int, long long int> > &p1,
                  const pair<pair<long long int, long long int>,
                             pair<long long int, long long int> > &p2) const {
    pair<long long int, long long int> p = p1.first, q = p2.first;
    return p.first * q.second > p.second * q.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 2e4 + 5, inf = 2e18;
int dp[N][55];
int last[105];
void solve() {
  int n, k, p;
  cin >> n >> k >> p;
  vector<int> v(n + 1), pref(n + 1);
  for (long long int i = (long long int)1; i < (long long int)(n + 1); i++) {
    cin >> v[i];
    v[i] %= p;
    pref[i] += pref[i - 1] + v[i];
    pref[i] %= p;
  }
  int sum = 0;
  memset(dp, -1, sizeof dp);
  memset(last, -1, sizeof last);
  dp[0][0] = 0;
  last[0] = 0;
  for (long long int i = (long long int)1; i < (long long int)(n + 1); i++) {
    sum = 0;
    for (int x = 0; x < p; x++) {
      if (last[x] == -1) continue;
      int j = last[x];
      sum = (pref[i] - pref[j]) % p;
      if (sum < 0) sum += p;
      for (int t = 0; t <= k; t++) {
        if (dp[j][t] == -1) continue;
        dp[i][t + 1] = max(dp[i][t + 1], sum + dp[j][t]);
      }
    }
    dp[i][1] = max(dp[i][1], pref[i]);
    last[pref[i]] = i;
  }
  cout << dp[n][k];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
