#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 160,K = 15,INF = 1e9;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}
//
int n,x,w,c[N],m[N],p[2*K];

int f[N][N],g[N][N][K],h[N][N][K];

int main(){
    cin>>n>>x>>w;
    for(int i=1;i<=n;i++)cin>>c[i];
    for(int i=1;i<=n;i++)cin>>m[i];
    for(int i=x;i<=2*x-2;i++)cin>>p[i];
    //
    for(int i=0;i<=n+1;i++)for(int j=0;j<=n+1;j++){
        f[i][j] = -INF;
        for(int k=0;k<x;k++)g[i][j][k] = h[i][j][k] = -INF;
    }
    for(int i=1;i<=n;i++)g[i][i][m[i]] = 0;
    for(int l=n;l>=1;l--){
        for(int r=l;r<=n;r++){
            for(int k=1;k<x;k++){
                tomax(f[l][r],g[l][r][k] - w*(x-k) + p[x]);
            }
            for(int nr=r+1;nr<=n;nr++){
                tomax(f[l][nr],f[l][r] + f[r+1][nr]);

                for(int k1=1;k1<x;k1++){
                    tomax(h[l][nr][k1],g[l][r][k1] + f[r+1][nr]);
                    if(c[r+1] != c[nr] || c[r+1] != c[l])continue;
                    for(int k2=1;k2<x;k2++){
                        if(k1+k2 < x){
                            tomax(g[l][nr][k1+k2],h[l][r][k1] + g[r+1][nr][k2]);
                        }else{
                            tomax(f[l][nr],h[l][r][k1] + g[r+1][nr][k2] + p[k1+k2]);
                        }
                    }
                }
            }
        }
    }
    cout<<f[1][n]<<endl;

    return 0;
}