#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=350+10;
int a[MAXN],f[41][41][41][41],num[MAXN];
int main(){
	freopen("tortoise.in","r",stdin);
	freopen("tortoise.out","w",stdout);
	int n,m,b;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	cin>>a[i];
	for(int i=1;i<=m;i++){
	cin>>b;
	num[b]++;
}
    f[0][0][0][0]=a[1];
 for(int i=0;i<=num[1];i++)
  for(int j=0;j<=num[2];j++)
   for(int k=0;k<=num[3];k++)
    for(int l=0;l<=num[4];l++){
     int bri=i+j*2+k*3+l*4+1;
     if(i>0) f[i][j][k][l]=max(f[i][j][k][l],f[i-1][j][k][l]+a[bri]);
     if(j>0) f[i][j][k][l]=max(f[i][j][k][l],f[i][j-1][k][l]+a[bri]);
     if(k>0) f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k-1][l]+a[bri]);
     if(l>0) f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k][l-1]+a[bri]);
 }
   cout<<f[num[1]][num[2]][num[3]][num[4]];
   fclose(stdin);
   fclose(stdout);
   return 0;
}