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

int P[MAXN+1];

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

    scanf("%d%d", &N, &M); P[0] = 0;
    for (int i=1; i<=N; i++) {
        scanf("%d", &x);
        P[i] = P[i-1]+x;
    }

    for (int i=1; i<=N; i++) {
        for (int j=i; j<=N; j++) {
            sum = P[j]-P[i-1];
            if (sum % M == 0) ans = std::max(ans, sum);
        }
    }
    printf("%d\n", ans);
}