#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

#include <set>

using namespace std;

typedef long long ll;

const int N=2e5+;

inline ll read(){

    char c=getchar();ll x=,f=;

    while(c<''||c>''){if(c=='-')f=-;c=getchar();}

    while(c>=''&&c<=''){x=x*+c-'';c=getchar();}

    return x*f;

}

int n;

ll P,a[N],ans;

set<ll> S;

set<ll>::iterator it;

int main(){

    freopen("in","r",stdin);

    n=read();P=read();

    for(int i=;i<=n;i++) a[i]=(read()%P+P+a[i-])%P;

    for(int i=;i<=n;i++){

        it=S.upper_bound(a[i]);

        if(it!=S.end()) ans=max(ans,a[i]-(*it)+P);

        else ans=max(ans,a[i]-(*S.begin()));

        S.insert(a[i]);

    }

    printf("%lld",ans);

}