#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;

inline void up(int &a,const int &b){ if(a<b)a=b; }
const int maxn = 200;
const int maxk = 12;
const int inf  = 1e15;

int n,K,W;
int ci[maxn],mi[maxn];
int pi[maxn];

int f[maxn][maxn][maxk],g[maxn][maxn];

signed main()
{
	ios_base::sync_with_stdio(false);
	
	cin>>n>>K>>W;
	for(int i=1;i<=n;i++) cin>>ci[i];
	for(int i=1;i<=n;i++) cin>>mi[i];
	for(int i=K;i<=2*K-2;i++) cin>>pi[i];
	
	if(n<=10)
	
	{
		auto elim=[&](vector<pair<int,int>>& now)
	{
		int ok=0,sum=0;
		while(not ok)
		{
			ok=1;
			for(int i=0;i<(int)now.size();i++)
			{
				if(now[i].second>=K)
				{
					sum+=pi[now[i].second];
					now.erase(now.begin()+i);
					ok=0;
					break;
				}
				if(i+1<(int)now.size() and now[i].first==now[i+1].first)
				{
					now[i].second+=now[i+1].second;
					now.erase(now.begin()+i+1);
					ok=0;
					break;
				}
			}
		}
		return sum;
	};
	long long ans=-inf;
	function<void(vector<pair<int,int>>,int)> dfs=[&](vector<pair<int,int>> now,int cost)
	{
		if(now.empty())
		{
			ans=max(ans,cost);
			return;
		}
		for(int i=0;i<(int)now.size();i++)
		{
			auto tmp=now;
			int tw=K-tmp[i].second;
			tmp[i].second=K;
			int del=elim(tmp);
			dfs(tmp,cost+del-tw*W);
		}
	};
	vector<pair<int,int>> a;
	for(int i=1;i<=n;i++)a.emplace_back(ci[i],mi[i]);
	dfs(a,0);
	cout<<ans<<endl;
	return 0;
	}
	for(int i=1;i<=n;i++) 
	{
		for(int k=0;k<=K;k++) f[i][i][k]=-inf;
		f[i][i][mi[i]]=0;
		g[i][i]= pi[K]-W*(K-mi[i]);
	}
	for(int L=2;L<=n;L++)
	{
		for(int r=L;r<=n;r++)
		{
			int l= r-L+1;
			
			g[l][r]=-inf;
			for(int k=0;k<=K;k++) f[l][r][k]=-inf;
			
			for(int mid=l+1;mid<=r;mid++)
			{
				//f+f
				if(ci[l]==ci[mid])
				{
					for(int x=1;x<K;x++) for(int y=1;y<K;y++) 
					{
						if(x+y>=K)
						{
							up(g[l][r],f[l][mid-1][x]+f[mid][r][y]+pi[x+y]);
						}
						else
						{
							up(f[l][r][x+y],f[l][mid-1][x]+f[mid][r][y]);
						}
					}
				}
				//f+g
				for(int x=1;x<K;x++) up(f[l][r][x],f[l][mid-1][x]+g[mid][r]);
				//g+f
				//for(int y=1;y<K;y++) up(f[l][r][y],g[l][mid-1]+f[mid][r][y]);
				//g+g
				up(g[l][r],g[l][mid-1]+g[mid][r]);
			}
		//	if( r!=n&&ci[l]==ci[r+1] )
		//	{
		//		for(int k=1;k<K;k++) f[l][r][k]=-inf;
		//	}
			if(r==n||ci[l]!=ci[r+1])
			{
				for(int k=1;k<K;k++) up(g[l][r],f[l][r][k]+pi[K]-W*(K-k));
			}
		//	if( l!=1&&r!=n&&ci[l-1]==ci[r+1] ) g[l][r]=-inf;
			
		}
	}
	cout<<g[1][n]<<endl;
	
	return 0;
}