#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn = 100010,INF = 100000000;
int A[maxn],S[maxn];
int N,K,P,Ans;



void prep()
{
	scanf("%d%d%d",&N,&K,&P);
	for (int i=1; i<=N; i++) scanf("%d",&A[i]);
	for (int i=1; i<=N; i++) S[i] = (S[i-1] + A[i])%P;
}

void work()
{
	int Ans = INF;
	for (int i=1; i<=N; i++)
		for (int j=0; j<i; j++)
		{
			int num = (S[i] - S[j] + P)%P;
			if (num >=K && num <Ans) Ans = num;
		}
	printf("%d\n",Ans);
}

int main()
{
	freopen("suma.in","r",stdin);
	freopen("suma.out","w",stdout);
	prep();
	work();
	return 0;
}