#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<map>
#include<vector>
#include<set> 
#define inf 0x7fffffff
#define ll long long
#define ull unsigned long long
#define fi first
#define se second
using namespace std;
int n,m;
int a[500],b[125],c[5],f[42][42][42][42];
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",&a[i]);
	for(int i=1;i<=m;i++)scanf("%d",&b[i]),c[b[i]]++;
	for(int i=0;i<=c[1];i++)
	{
		for(int j=0;j<=c[2];j++)
		{
			for(int k=0;k<=c[3];k++)
			{
				for(int p=0;p<=c[4];p++)
				{
					if(i!=0)f[i][j][k][p]=max(f[i][j][k][p],f[i-1][j][k][p]);
					if(j!=0)f[i][j][k][p]=max(f[i][j][k][p],f[i][j-1][k][p]);
					if(k!=0)f[i][j][k][p]=max(f[i][j][k][p],f[i][j][k-1][p]);
					if(p!=0)f[i][j][k][p]=max(f[i][j][k][p],f[i][j][k][p-1]);
					f[i][j][k][p]+=a[i*1+j*2+k*3+p*4+1];
				}
			}
		}
	}printf("%d\n",f[c[1]][c[2]][c[3]][c[4]]);
}