#include "lawn.h"
#include <iostream>
#include <cassert>
using namespace std;
using ll=long long;
namespace
{
const int MN=5013;
const ll inf64=1e18;
int N; ll C, B;
ll A[MN], V[MN], pre[MN];
ll dp[MN];
}
ll mow(int n, int c, int b, vector<int> &a, vector<int> &v)
{
N=n; C=c; B=b;
for (int i=1; i<=N; i++) A[i]=a[i-1];
for (int i=1; i<=N; i++)
{
V[i]=v[i-1];
pre[i]=(pre[i-1]+V[i])%C;
}
for (int j=0; j<C; j++) dp[j]=inf64;
dp[0]=0;
for (int i=1; i<=N; i++)
{
ll cnt=V[i]/C;
for (int j=0; j<C; j++) dp[j]+=B*cnt+A[i]*(cnt+1);
if (V[i]%C)
{
int L=(C-pre[i])%C, R=C-pre[i-1]-1;
if (L<=R)
{
for (int j=L; j<=R; j++)
{
dp[j]+=B+A[i];
}
}
else
{
for (int j=L; j<C; j++)
{
dp[j]+=B+A[i];
}
for (int j=0; j<=R; j++)
{
dp[j]+=B+A[i];
}
}
}
dp[(C-pre[i])%C]-=A[i];
for (int j=0; j<C; j++) dp[(C-pre[i])%C]=min(dp[(C-pre[i])%C], dp[j]+B);
}
return dp[(C-pre[N])%C];
}
