#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,w,p[20],a[159],c[159],f[159][159],g[159][159][10][10],h[159],hh[159][159][159][3];
inline ll read(){
	ll s = 0,w = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0'){ if (ch == '-') w = -1; ch = getchar();}
	while (ch <= '9' && ch >= '0') s = (s << 1) + (s << 3) + (ch ^ 48),ch = getchar();
	return s * w;
}
inline void chkmax(ll &x,ll y){if (x < y) x = y;}
int main(){
	n = read(),m = read(),w = read();
	for (ll i = 1;i <= n;i += 1) c[i] = read();
	for (ll i = 1;i <= n;i += 1) a[i] = read();
	for (ll i = m;i <= 2 * m - 2;i += 1) p[i] = read();
	for (ll i = 1;i <= n;i += 1) for (ll j = i;j <= n;j += 1){
		f[i][j] = -1e18;
		for (ll k = 0;k < m;k += 1) for (ll l = 0;l < m;l += 1) g[i][j][k][l] = -1e18;
        for (ll k = 1;k <= n;k += 1) for (ll l = 0;l < 3;l += 1) hh[i][j][k][l] = -1e18;
	}
	for (ll i = n;i >= 1;i -= 1){
		ll cnt = 0;
		for (ll j = i;j <= n;j += 1){
			cnt += (c[i] == c[j]) * a[j];
			if (i == j){
				f[i][j] = p[m] - w * (m - a[i]);
				g[i][j][a[i]][0] = 0;
                for (ll k = 1;k <= n;k += 1){
                    if (k == c[i]) continue;
                    hh[i][j][k][0] = f[i][j];
                }
				continue;
			}
			ll res = -1e18;
			for (ll k = 0;k <= min(m - 1,cnt);k += 1){
				for (ll l = 0;l <= m - 1 && k + l <= cnt;l += 1){
					if (c[i] == c[j]){
						if (k >= a[j] && !l) chkmax(g[i][j][k][l],g[i][j - 1][k - a[j]][l]);
						if (l >= a[j]) chkmax(g[i][j][k][l],g[i][j - 1][k][l - a[j]]);
						//if (i == 1 && j == 3) cout<<k<<' '<<l<<' '<<g[i][j][k][l]<<"HHH"<<endl;
						if (k + l < m) chkmax(res,g[i][j][k][l] + p[m] - w * (m - k - l));
						else chkmax(res,g[i][j][k][l] + p[k + l]);
					}
                    if (c[i] == c[j + 1]){
                        for (ll o = i;o < j;o += 1){
                            if (c[o] != c[i]) continue;
                            chkmax(g[i][j][k][l],g[i][o][k][l] + hh[o + 1][j][c[i]][0]);
                            chkmax(g[i][j][k][l],g[i][o][k][l] + hh[o + 1][j][c[i]][2]);
						    //if (i == 1 && j == 2) cout<<k<<' '<<l<<' '<<o<<' '<<g[i][j][k][l]<<"WTF"<<endl;
                        }
                    }
				}
			}
			if (c[i] == c[j]) f[i][j] = res;
            for (ll k = i;k <= j;k += 1){
                if (c[k] != c[j]) continue;
                for (ll l = 1;l <= n;l += 1){
                    if (c[i] == l) continue;
                    if (k == i){
                        chkmax(hh[i][j][l][0],f[i][j]);
                        continue;
                    }
                    if (c[j] != l && c[j] != c[i]){
                        chkmax(hh[i][j][l][2],hh[i][k - 1][l][0] + f[k][j]);
                        chkmax(hh[i][j][l][2],hh[i][k - 1][l][1] + f[k][j]);
                        chkmax(hh[i][j][l][2],hh[i][k - 1][l][2] + f[k][j]);
                    }
                    else if (c[j] == l){
                        chkmax(hh[i][j][l][1],hh[i][k - 1][l][0] + f[k][j]);
                        chkmax(hh[i][j][l][1],hh[i][k - 1][l][1] + f[k][j]);
                        chkmax(hh[i][j][l][2],hh[i][k - 1][l][2] + f[k][j]);
                    }
                    else{
                        chkmax(hh[i][j][l][0],hh[i][k - 1][l][0] + f[k][j]);
                        chkmax(hh[i][j][l][1],hh[i][k - 1][l][1] + f[k][j]);
                        chkmax(hh[i][j][l][2],hh[i][k - 1][l][2] + f[k][j]);
                    }
                }
            }
		}
	}
	//for (ll i = 1;i <= n;i += 1) for (ll j = i;j <= n;j += 1) cout<<i<<'.'<<j<<' '<<f[i][j]<<endl;
    for (ll i = 1;i <= n;i += 1){
        h[i] = -1e18;
        for (ll j = 1;j <= i;j += 1) chkmax(h[i],h[j - 1] + f[j][i]);
    }
	printf("%lld",h[n]);
    return 0;
}