#include<bits/stdc++.h>
#define ll long long 
using namespace std;
const int N=2e5+5;
int a[N];
ll f[N],g[N];
int main(){
//	freopen("a.in","r",stdin);
	int n,m;
	ll ans=0;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i){
		scanf("%d",&a[i]);
		f[i]=a[i];
	}
	for(int i=1;i<=n;++i){
		f[i]=max(f[i],g[(m-a[i]%m)%m]+a[i]);
		g[a[i]%m]=max(g[a[i]%m],f[i]);
	}
	for(int i=1;i<=n;++i)ans=max(ans,f[i]);
	printf("%lld",ans);
	return 0;
}