#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 110;

int f[N][N];
int n, k;
int a[N];

int main()
{
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);

    memset(f, -0x3f, sizeof f);
    f[0][0] = 0;
    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j < k; j ++ )
            f[i][j] = max(f[i - 1][j], f[i - 1][(j + a[i]) % k] + a[i]);

    printf("%d\n", f[n][0]);

    return 0;
}