#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int N = 160,K = 15,INF = 1e18;
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][4],g[N][N][K],h[N][N];
int f2[N][N][4],g2[N][N][K];

int W(int k){
    return -w*(x-k) + p[x];
}
signed 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 l=0;l<=n+1;l++)for(int r=0;r<=n+1;r++){
        h[l][r] = -INF;
        for(int k=1;k<x;k++)g[l][r][k] = g2[l][r][k] = -INF;
        for(int S=0;S<4;S++)f[l][r][S] = f2[l][r][S] = -INF;
    }
    for(int l=1;l<=n+1;l++)for(int S=0;S<4;S++)f[l][l-1][S] = 0;
    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 k1=1;k1<x;k1++){
                //g->g2
                for(int nr=r+1;nr<n;nr++){
                    if(c[l] != c[r] || c[r] != c[nr+1])continue;
                    tomax(g2[l][nr][k1],g[l][r][k1] + f[r+1][nr][3]);
                }
                //g2->g/h
                for(int nr=r+1;nr<=n;nr++){
                    if(c[r+1] != c[nr])continue;
                    for(int k2=1;k2<x;k2++){
                        if(k1+k2 < x)tomax(g[l][nr][k1+k2],g2[l][r][k1] + g[r+1][nr][k2]);
                        else tomax(h[l][nr],g2[l][r][k1] + g[r+1][nr][k2] + p[k1+k2]);
                    }
                }
            }
        }
        for(int r=l-1;r<=n;r++){
            //f2->f
            for(int S=0;S<4;S++){
                for(int nr=r;nr<=n;nr++){
                    if(c[r] == c[nr+1])continue;
                    for(int T=0;T<4;T++){
                        int nT = T | 1; //不考虑左端点
                        tomax(f[l][nr][S&nT],f2[l][r][S] + f[r+1][nr][T]);
                    }
                }
            }
            //f->f2
            for(int S=0;S<4;S++){
                for(int nr=r+1;nr<=n;nr++){
                    if(c[r+1] != c[nr] || c[r+1] == c[l-1])continue;
                    int nS = S | 2; //不考虑右端点
                    tomax(f2[l][nr][nS],f[l][r][S] + h[r+1][nr]);
                    for(int k=1;k<x;k++){
                        tomax(f2[l][nr][nS],f[l][r][S] + g[r+1][nr][k] + W(k));
                    }
                }
            }
        }
    }
    int ans = -INF;
    for(int S=0;S<4;S++){
        tomax(ans,f[1][n][S]);
    }
    cout<<ans<<endl;
    return 0;
}