#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cmath>
#define MAXN 360
#define NUM 41
using namespace std;
int n,m;
int N[MAXN]={0}; 
int f[NUM][NUM][NUM][NUM];
int a=0,b=0,c=0,d=0;
int main()
{
	freopen("tortoise.in","r",stdin);
	freopen("tortoise.out","w",stdout);
	cin>>n>>m;
	for(int i=0;i<n;i++)
	{
		cin>>N[i];	
	}
	for(int i=0;i<m;i++)
	{
		int x;
		cin>>x;
		if(x==1)
		{
			a++;
		}
		if(x==2)
		{
			b++;
		}
		if(x==3)
		{
			c++;
		}
		if(x==4)
		{
			d++;
		}
	}
	for(int i=0;i<=a;i++)
	{
		for(int j=0;j<=b;j++)
		{
			for(int k=0;k<=c;k++)
			{
				for(int l=0;l<=d;l++)
				{
					if(i!=0)f[i][j][k][l]=max(f[i][j][k][l],f[i-1][j][k][l]);
					if(j!=0)f[i][j][k][l]=max(f[i][j][k][l],f[i][j-1][k][l]);
					if(k!=0)f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k-1][l]);
					if(l!=0)f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k][l-1]);
					f[i][j][k][l]+=N[i+2*j+3*k+4*l];
				}
			}
		}
	}
	cout<<f[a][b][c][d]<<endl;
	return 0;
}