#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#define LL long long
using namespace std;
const int maxn=45;
int f[maxn][maxn][maxn][maxn],n,m,a[maxn*10];
int yi,er,san,si;
void Init();
void Begin(){freopen("tortoise.in","r",stdin);freopen("tortoise.out","w",stdout);}
void End(){fclose(stdin);fclose(stdout);}

int main(){
    Begin();
    Init();
    //system("pause");
    End();
    return 0;
}
void Init(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<=m;i++){
		int x;scanf("%d",&x);
		if(x==1)yi++;if(x==2)er++;if(x==3)san++;if(x==4)si++;
	}
	f[0][0][0][0]=a[1];
	for(int i=0;i<=yi;i++){
		for(int j=0;j<=er;j++){
			for(int k=0;k<=san;k++){
				for(int p=0;p<=si;p++){
					int ans=0;
					if(i>0)ans=max(ans,f[i-1][j][k][p]+a[i*1+j*2+k*3+p*4+1]);
					if(j>0)ans=max(ans,f[i][j-1][k][p]+a[i*1+j*2+k*3+p*4+1]);
					if(k>0)ans=max(ans,f[i][j][k-1][p]+a[i*1+j*2+k*3+p*4+1]);
					if(p>0)ans=max(ans,f[i][j][k][p-1]+a[i*1+j*2+k*3+p*4+1]);
					f[i][j][k][p]=max(f[i][j][k][p],ans);
				}
			}
		}
	}
	printf("%d\n",f[yi][er][san][si]);
}