#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int f[2550],n,m;
int cost[2550];
int main()
{
	freopen("cowriver.in","r",stdin);
	freopen("cowriver.out","w",stdout);
	scanf("%d%d",&n,&m);
	cost[0]=2*m;
	for(int i=1;i<=n;i++)
	{
		int o;
		scanf("%d",&o);
		cost[i]=cost[i-1]+o;
	}
	memset(f,127,sizeof(f));
	for(int i=1;i<=n;i++)
	{
		f[i]=cost[i];
	    for(int j=0;j<=i-1;j++)
        {
      	    f[i]=min(f[i],f[j]+cost[i-j]);
	    }
	}
	printf("%d",f[n]-m);
	fclose(stdin);
	fclose(stdout);
	return 0;
}