#include <cstdio>
#include <algorithm>
#define MAXN 1000000
#define MAXM 1000000

int L[MAXM], U[MAXM];

int main() {
    int N, M, x, sum = 0, ans = 0;

    scanf("%d%d", &N, &M);
    for (int i=0; i<M; i++) L[i] = U[i] = -1;
    L[0] = 0;
    for (int i=1; i<=N; i++) {
        scanf("%d", &x);
        sum += x;
        int res = sum % M;
        if (L[res] == -1) L[res] = sum;
        else U[res] = sum;
    }

    ans = std::max(L[0], U[0]);
    for (int i=1; i<=M-1; i++)
        if (L[i] >= 0 && U[i] >= 0) ans = std::max(ans, U[i]-L[i]);
    printf("%d\n", ans);
}