#include<bits/stdc++.h>
using namespace std;
const int N=155;
int n,m,w,a[N],b[N],p[25],dp[N][N],fl[N][N][11],fr[N][N][11];
inline void U(int &x,int y){
	if(x<y)x=y;
}
int main(){
	scanf("%d%d%d",&n,&m,&w);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]);
	for(int i=1;i<=n;++i)scanf("%d",&b[i]);
	for(int i=m;i<=2*m-2;++i)scanf("%d",&p[i]);
	for(int i=1;i<m;++i)p[i]=p[m]-(m-i)*w;
	memset(dp,-0x3f,sizeof(dp));
	memset(fl,-0x3f,sizeof(fl));
	memset(fr,-0x3f,sizeof(fr));
	for(int i=1;i<=n;++i)dp[i][i]=p[b[i]],dp[i][i-1]=0;
	for(int l=n-1;l;--l)for(int r=l+1;r<=n;++r){
		U(fr[l][r][a[r]],dp[l][r-1]);
		for(int k=l;k<r;++k)if(a[k]==a[r])for(int i=1;i+b[k]<m;++i)U(fr[l][r][i+b[k]],fr[k+1][r][i]+dp[l][k-1]);
		U(fl[l][r][a[l]],dp[l+1][r]);
		for(int k=r;k>l;--k)if(a[k]==a[l])for(int i=1;i+b[k]<m;++i)U(fl[l][r][i+b[k]],fl[l][k-1][i]+dp[k+1][r]);
		for(int k=l;k<r;++k)if(a[k]!=a[r+1]||a[k+1]!=a[l-1])U(dp[l][r],dp[l][k]+dp[k+1][r]);
		if(a[l]!=a[r])continue;
		U(dp[l][r],dp[l+1][r-1]+p[b[l]+b[r]]);
		for(int k=l+1;k<r;++k)if(a[k]==a[l])
			for(int i=1;i<m;++i)for(int j=1;j<m;++j)if(i+b[k]<m||j+b[k]<m){
				U(dp[l][r],fl[l][k-1][i]+fr[k+1][r][j]+p[i+j+b[k]]);
				U(dp[l][r],fl[l][k-1][j]+fr[k+1][r][i]+p[i+j+b[k]]);
			}
	}
	printf("%d\n",dp[1][n]);
	return 0;
}