#include<iostream>
#include<cstdio>
using namespace std;
int read()
{
	int x,f=1;
	char ch;
	while(ch=getchar(),!isdigit(ch))if(ch=='-')f=-1;
	x=ch-48;
	while(ch=getchar(),isdigit(ch))x=x*10+ch-48;
	return x*f;
}
void write(int x)
{
	int cnt=0;char ch[50];
	while(ch[++cnt]=x%10+48,x/=10);
	while(putchar(ch[cnt]),--cnt);
	putchar('\n');
}
int f[45][45][45][45],val[400],ha[6];
int main()
{
	freopen("tortoise.in","r",stdin);
	freopen("tortoise.out","w",stdout);
	int n=read(),m=read();
	for(int i=1;i<=n;i++)val[i]=read();
	for(int i=1;i<=m;i++)ha[read()]++;
	f[0][0][0][0]=val[1];
	int ans=0;
	for(int a=0;a<=ha[1];a++)
	{
		for(int b=0;b<=ha[2];b++)
		{
			for(int c=0;c<=ha[3];c++)
			{
				for(int d=0;d<=ha[4];d++)
				{
					if(a>0)f[a][b][c][d]=max(f[a][b][c][d],f[a-1][b][c][d]+val[a*1+b*2+c*3+d*4+1]);//注意加1，下标不是从0开始的 
					if(b>0)f[a][b][c][d]=max(f[a][b][c][d],f[a][b-1][c][d]+val[a*1+b*2+c*3+d*4+1]);
					if(c>0)f[a][b][c][d]=max(f[a][b][c][d],f[a][b][c-1][d]+val[a*1+b*2+c*3+d*4+1]);
					if(d>0)f[a][b][c][d]=max(f[a][b][c][d],f[a][b][c][d-1]+val[a*1+b*2+c*3+d*4+1]); 
				}
			}
		}
	}
	write(f[ha[1]][ha[2]][ha[3]][ha[4]]);
	fclose(stdin);
	fclose(stdout);
}