#include<bits/stdc++.h>
using namespace std;
const int N=510;
int p[N];
int c[N],m[N];
long long G[N][12],F[N][N];
int n,k,w;
long long ask(long long w1,int m)
{
	int r=max(k-m,0);m+=r,w1-=r*w;
	return w1+p[m];
}
void ckmax(long long&A,long long B){(A<B)&&(A=B);}
int main()
{
	cin>>n>>k>>w;
	for(int i=1;i<=n;++i)cin>>c[i];
	for(int i=1;i<=n;++i)cin>>m[i];
	for(int i=k;i<=k*2-2;++i)cin>>p[i];
	for(int d=1;d<=n;++d)
		for(int l=1,r=d;r<=n;++l,++r)
		{
			memset(G,-0x3f,sizeof G);
			G[l][m[l]]=0;
			long long ans=ask(F[l+1][r],m[l]);
			for(int t=l+1;t<=r;++t)if(c[t]==c[l])
				for(int p=l;p<t;++p)if(c[p]==c[l])
					for(int s=1;s<k;++s)
					{
						ckmax(ans,
		ask(G[p][s]+F[p+1][t-1]+F[t+1][r],s+m[t]));
						if(s+m[t]<k)
							ckmax(G[t][s+m[t]],
						G[p][s]+F[p+1][t-1]);
					}
			F[l][r]=ans;
		}
	cout<<F[1][n]<<endl;
}