#include <bits/stdc++.h>
using namespace std;
long long n,p,i,tz[1000005],fs[1000005];
long long a[1000005],sum_tz,sum_fs;
int main()
{
  cin>>n>>p;
  for(i=1;i<=n;i++)
  	cin>>a[i];
	fs[1]=tz[1]=a[1];
	sum_tz=tz[1];
	sum_fs=fs[1];
  for(i=2;i<=n;i++)
  {
  	sum_tz=max(sum_tz,sum_tz+a[i]);
  	tz[i]=sum_tz;
  	sum_fs=max(sum_fs,tz[i-1]+fs[i-1]);
  	fs[i]=sum_fs;
  }
  cout<<sum_fs%p<<endl;
  return 0;
}