#include<bits/stdc++.h>
using namespace std;
const int maxn=40+1,maxn2=360;
int f[maxn][maxn][maxn][maxn],n,m,a1,a[5],mp[maxn2];
void run(int k1,int k2,int k3,int k4){
	if(k1!=0)f[k1][k2][k3][k4]=max(f[k1][k2][k3][k4],f[k1-1][k2][k3][k4]+mp[k1+2*k2+3*k3+4*k4+1]);
	if(k2!=0)f[k1][k2][k3][k4]=max(f[k1][k2][k3][k4],f[k1][k2-1][k3][k4]+mp[k1+2*k2+3*k3+4*k4+1]);
	if(k3!=0)f[k1][k2][k3][k4]=max(f[k1][k2][k3][k4],f[k1][k2][k3-1][k4]+mp[k1+2*k2+3*k3+4*k4+1]);
	if(k4!=0)f[k1][k2][k3][k4]=max(f[k1][k2][k3][k4],f[k1][k2][k3][k4-1]+mp[k1+2*k2+3*k3+4*k4+1]);	
	return;
}
int main(){
	freopen("tortoise.in","r",stdin);
	freopen("tortoise.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&mp[i]);
	for(int i=1;i<=m;i++)scanf("%d",&a1),a[a1]+=1;
	f[0][0][0][0]=mp[1]; 
	for(int p1=0;p1<=a[1];p1++)
		for(int p2=0;p2<=a[2];p2++)
			for(int p3=0;p3<=a[3];p3++)
				for(int p4=0;p4<=a[4];p4++)
					run(p1,p2,p3,p4);
	printf("%d",f[a[1]][a[2]][a[3]][a[4]]);
	return 0;
}