#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long int binomial(long long int n, long long int k) {
  long long int C[k + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    for (int j = min(i, k); j > 0; j--) C[j] = C[j] + C[j - 1];
  }
  return C[k];
}
vector<int> pr;
bool prime[10000000];
void Sieve(long long int n) {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      pr.push_back(p);
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int find(int arr[], int n) {
  int result = arr[0];
  for (int i = 1; i < n; i++) {
    result = gcd(arr[i], result);
    if (result == 1) {
      return 1;
    }
  }
  return result;
}
pair<int, int> fib(int n) {
  if (n == 0) return {0, 1};
  auto p = fib(n >> 1);
  int c = p.first * (2 * p.second - p.first);
  int d = p.first * p.first + p.second * p.second;
  if (n & 1)
    return {d, c + d};
  else
    return {c, d};
}
void reverse(string& str) {
  int n = str.length();
  for (int i = 0; i < n / 2; i++) swap(str[i], str[n - i - 1]);
}
string fun(string s) {
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == 'O' || s[i] == 'o') {
      s[i] = '0';
    } else if (s[i] == 'l' || s[i] == 'I' || s[i] == 'L' || s[i] == 'i') {
      s[i] = '1';
    } else if (isupper(s[i])) {
      s[i] = tolower(s[i]);
    }
  }
  return s;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  long long int p;
  cin >> p;
  int a[n];
  long long int s = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    s += a[i];
  }
  for (int i = 1; i < n; i++) {
    a[i] += a[i - 1];
  }
  long long int m = 0;
  for (int i = 0; i < n; i++) {
    long long int l = a[i] % p;
    long long int k = (s - a[i]) % p;
    m = max(m, l + k);
  }
  cout << m << endl;
}
