#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll n,k,w,c[155],m[155],p[22],f[155][155],g[155][155][11],h[155][155][11];
int main(){
	n=read();
	k=read();
	w=read();
	fr(i,1,n) c[i]=read();
	fr(i,1,n) m[i]=read();
	fr(i,k,2*k-2) p[i]=read();
	fr(i,1,n) fr(j,1,n) f[i][j]=-inf;
	fr(i,1,n) fr(j,1,n) fr(l,1,k-1) g[i][j][l]=h[i][j][l]=-inf;
	fr(i,1,n) g[i][i][m[i]]=0;
	fr(len,1,n){
		fr(l,1,n-len+1){
			ll r=l+len-1;
			fr(mid,l,r-1){
				if(c[l]!=c[mid+1]) continue;
				fr(x,1,k-1){
					fr(y,1,k-1){
						if((x+y)<k) g[l][r][x+y]=max(g[l][r][x+y],h[l][mid][x]+g[mid+1][r][y]);
						else f[l][r]=max(f[l][r],h[l][mid][x]+g[mid+1][r][y]+p[x+y]);
					}
				}
			}
			if(c[l]==c[r+1]){
				fr(mid,l,r-1) fr(x,1,k-1) h[l][r][x]=max(h[l][r][x],g[l][mid][x]+f[mid+1][r]);
			}
			else{
				fr(mid,l,r-1) fr(x,1,k-1) g[l][r][x]=max(g[l][r][x],g[l][mid][x]+f[mid+1][r]);
			}
			fr(x,1,k-1){
				if(x<(k-1)) g[l][r][x+1]=max(g[l][r][x+1],g[l][r][x]-w);
				else f[l][r]=max(f[l][r],g[l][r][x]-w+p[k]);
			}
		}
	}
	write(f[1][n]);
}