#include<cstdio>
#include<iostream>
#define maxn 50

using namespace std;

int n,m,x;
int val[360],cnt[10],f[maxn][maxn][maxn][maxn];

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",&val[i]);
	for(int i=1;i<=m;i++){
		scanf("%d",&x);cnt[x]++;
	}
	f[0][0][0][0]=val[1];
	for(int i=0;i<=cnt[1];i++)
		for(int j=0;j<=cnt[2];j++)
			for(int k=0;k<=cnt[3];k++)
				for(int p=0;p<=cnt[4];p++){
					x=1+i+(j<<1)+k+(k<<1)+(p<<2);
					if(i)f[i][j][k][p]=max(f[i][j][k][p],f[i-1][j][k][p]+val[x]);
					if(j)f[i][j][k][p]=max(f[i][j][k][p],f[i][j-1][k][p]+val[x]);
					if(k)f[i][j][k][p]=max(f[i][j][k][p],f[i][j][k-1][p]+val[x]);
					if(p)f[i][j][k][p]=max(f[i][j][k][p],f[i][j][k][p-1]+val[x]);
				}
	printf("%d",f[cnt[1]][cnt[2]][cnt[3]][cnt[4]]);
	return 0;
}