#include <iostream>
using namespace std;
int n,m;
const int N=2e5+2;
int a[N];
long long g[N],ans=-1;
int f(int t){
	if(t%m==0)return 0;
	return m-t%m;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	a[0]=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		g[i]=0;
	}
	for(int i=1;i<=n;i++){
		g[a[i]%m]=max(g[a[i]%m],g[f(a[i]%m)]+a[i]);
		ans=max(ans,g[a[i]%m]);
	}
	cout<<ans<<endl;
	return 0;
}