#include<iostream>
#include<cstdio>
using namespace std;
int n,m,a[360],b[5],s,dp[41][41][41][41];
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",&s);
		b[s]++;
	}
	dp[0][0][0][0]=a[1];
	for(int i=0;i<=b[1];i++)
	for(int j=0;j<=b[2];j++)
	for(int k=0;k<=b[3];k++)
	for(int l=0;l<=b[4];l++){
		int sum=1+i+2*j+3*k+4*l;
		if(i)dp[i][j][k][l]=max(dp[i][j][k][l],dp[i-1][j][k][l]+a[sum]);
		if(j)dp[i][j][k][l]=max(dp[i][j][k][l],dp[i][j-1][k][l]+a[sum]);
		if(k)dp[i][j][k][l]=max(dp[i][j][k][l],dp[i][j][k-1][l]+a[sum]);
		if(l)dp[i][j][k][l]=max(dp[i][j][k][l],dp[i][j][k][l-1]+a[sum]);
	}
	printf("%d",dp[b[1]][b[2]][b[3]][b[4]]);
	return 0;
}