#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n;
long long a[N],m,ans;
long long mod,f[N],la[N];
int main(){
    scanf("%d%lld",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%lld",&a[i]);
    f[0]=0;
    memset(la,0,sizeof(la));
    for(int i=1;i<=n;i++){
    	mod=a[i]%m;
        if(mod==0)
            f[i]=f[la[0]]+a[i];
        else
            f[i]=f[la[m-mod]]+a[i];
        if(f[la[mod]]<=f[i])
        	la[mod]=i;
        ans=max(ans,f[i]);
    }
    printf("%lld\n",ans);
    return 0;
}