#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int w[351],f[41][41][41][41],n[5];
int main()
{
	freopen("tortoise.in","r",stdin);
	freopen("tortoise.out","w",stdout);
	int nn,m;
	scanf("%d%d",&nn,&m);
	for(int i=1;i<=nn;i++)
	scanf("%d",&w[i]);
	for(int i=1;i<=m;i++)
	{
		int q;
		scanf("%d",&q);
		n[q]++;
	}
	f[0][0][0][0]=w[1];
	for(int a=0;a<=n[1];a++)
	for(int b=0;b<=n[2];b++)
	for(int c=0;c<=n[3];c++)
	for(int d=0;d<=n[4];d++)
	{
		int m=1+a+b*2+c*3+d*4;
		if(a!=0)f[a][b][c][d]=max(f[a][b][c][d],f[a-1][b][c][d]+w[m]);
		if(b!=0)f[a][b][c][d]=max(f[a][b][c][d],f[a][b-1][c][d]+w[m]);
		if(c!=0)f[a][b][c][d]=max(f[a][b][c][d],f[a][b][c-1][d]+w[m]);
		if(d!=0)f[a][b][c][d]=max(f[a][b][c][d],f[a][b][c][d-1]+w[m]);
	}
	printf("%d",f[n[1]][n[2]][n[3]][n[4]]);
	return 0;
}