#include<bits/stdc++.h>
using namespace std;
const string hhh="老马666";
const int INF=0x7fffffff;
int dp[40][40][40][40],abc[351],mm[5];
int n,m,ans;
int dfs(int cur,int a,int b,int c,int d){
	if(!a&&!b&&!c&&!d)return dp[0][0][0][0]=abc[n];
	if(dp[a][b][c][d])return dp[a][b][c][d];
	int t=0;
	if(a>0)t=max(t,dfs(cur+1,a-1,b,c,d));	
	if(b>0)t=max(t,dfs(cur+2,a,b-1,c,d));
	if(c>0)t=max(t,dfs(cur+3,a,b,c-1,d));
	if(d>0)t=max(t,dfs(cur+4,a,b,c,d-1));
	return dp[a][b][c][d]=t+abc[cur];
}
int t;
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",&abc[i]);
	for(int i=1;i<=m;i++){
		scanf("%d",&t);
		mm[t]++;
	}
	printf("%d\n",dfs(1,mm[1],mm[2],mm[3],mm[4]));
	return 0;
}