#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5;
set<int> x;
int a[N+10],qzh[N+10],n,k,p,ans=1ll<<60;
signed main(){
cin>>n>>k>>p;
for(int i=0;i<n;i++){
cin>>a[i];
qzh[i]=(qzh[i-1]+a[i])%p;
}
x.insert(0);
for(int i=0;i<n;i++){
if(qzh[i]>=k){
ans=min(ans,(qzh[i]-(*--x.upper_bound(qzh[i]-k)%p))%p);
}
x.insert(qzh[i]);
}
cout<<ans;
return 0;
}