#include <bits/stdc++.h>

#define N 105

typedef long long ll;

using namespace std;

int a[N],w[N];
ll f[N][N],g[N][N][25][8],pw[N];

int main()
{
	int i,j,k,s,t,T,n,m,u;
	scanf("%d",&T);
	while(T--)
	{
		pw[0]=1;
		scanf("%d %d %d %lld",&n,&m,&u,&pw[1]);u=min(u,7);--u;
		for(i=2;i<=u;++i)pw[i]=pw[i-1]*pw[1];
		for(i=1;i<=n;++i)scanf("%d",&a[i]);
		for(i=1;i<=m;++i)scanf("%d",&w[i]);
		memset(f,-0x3f,sizeof(f));
		memset(g,-0x3f,sizeof(g));
		for(i=0;i<=n;++i)f[i+1][i]=0;
		for(i=1;i<=n;++i){f[i][i]=w[a[i]];g[i][i][a[i]][0]=0;}
		for(i=n;i;--i)
			for(j=i+1;j<=n;++j)
			{
				for(k=1;k<=m;++k)
					for(s=0;s<=u;++s)
					{
						if(s!=0)
							for(t=i;t<j;++t)
								g[i][j][k][s]=max(g[i][j][k][s],g[i][t][k][s-1]+g[t+1][j][k][s-1]);
						else
							for(t=i;t<=j;++t)
								if(a[t]==k)
									g[i][j][k][s]=max(g[i][j][k][s],f[i][t-1]+f[t+1][j]);
						
					}
				for(k=1;k<=m;++k)
					for(s=0;s<=u;++s)
						f[i][j]=max(f[i][j],g[i][j][k][s]+pw[s]*w[k]);
			}
		printf("%lld\n",f[1][n]);
	}
	return 0;
}