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

const int maxn = 200;
const int maxk = 12;
const ll inf  = 1e15;

int n,K,W;
int ci[maxn],mi[maxn];
int pi[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];
	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;
}