#include<iostream>
#include<cstdio>

using namespace std;

const int maxn=400;
const int maxm=45;

int n,m;
int temp,pos;
int val[maxn];
int f[maxm][maxm][maxm][maxm];
int aa,bb,cc,dd;

void reading()
{
	scanf("%d",&temp);
	if(temp==1) aa++;
	else if(temp==2) bb++;
	else if(temp==3) cc++;
	else if(temp==4) dd++;
}

int Cal(int a,int b,int c,int d)
{
	return 1+a+2*b+3*c+4*d;
}

int main()
{
	freopen("tortoise.in","r",stdin);
	freopen("tortoise.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(register int i=1;i<=n;i++) scanf("%d",val+i);
	for(register int i=1;i<=m;i++) reading();
	f[0][0][0][0]=val[1];
	for(register int i=0;i<=aa;i++)
	  for(register int j=0;j<=bb;j++)
	    for(register int k=0;k<=cc;k++)
	      for(register int g=0;g<=dd;g++)
	      {
	      	pos=Cal(i,j,k,g);
	      	if(i>0) f[i][j][k][g]=max(f[i][j][k][g],f[i-1][j][k][g]+val[pos]);
	      	if(j>0) f[i][j][k][g]=max(f[i][j][k][g],f[i][j-1][k][g]+val[pos]);
	      	if(k>0) f[i][j][k][g]=max(f[i][j][k][g],f[i][j][k-1][g]+val[pos]);
	      	if(g>0) f[i][j][k][g]=max(f[i][j][k][g],f[i][j][k][g-1]+val[pos]);
	      }
	printf("%d\n",f[aa][bb][cc][dd]);
	return 0;
}