#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	char ch=getchar();int x=0,f=1;
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10-48+ch;ch=getchar();}
	return x*f;
}
int f[45][45][45][45],n,m,a[355],b[5];
int main()
{
	freopen("tortoise.in","r",stdin);
	freopen("tortoise.out","w",stdout); 
	n=read(),m=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=m;i++)
	{
		int qwq=read();
		b[qwq]++;
	}
	f[0][0][0][0]=a[1];
	for(int i=0;i<=b[1];i++)
	for(int j=0;j<=b[2];j++)
	for(int k=0;k<=b[3];k++)
	for(int l=0;l<=b[4];l++)
	{
		if(i)f[i][j][k][l]=max(f[i][j][k][l],f[i-1][j][k][l]+a[1+i+j*2+k*3+l*4]);
		if(j)f[i][j][k][l]=max(f[i][j][k][l],f[i][j-1][k][l]+a[1+i+j*2+k*3+l*4]);
		if(k)f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k-1][l]+a[1+i+j*2+k*3+l*4]);
		if(l)f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k][l-1]+a[1+i+j*2+k*3+l*4]);
//		cout<<f[i][j][k][l]<<endl;
	}
	cout<<f[b[1]][b[2]][b[3]][b[4]]<<'\n';
	return 0;
}