#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 500,maxm = 200,maxc = 50;
int n,m,t,value[maxn],card[10],dp[maxc][maxc][maxc][maxc];
int main(){
    freopen("tortoise.in","r",stdin);        
    freopen("tortoise.out","w",stdout);     
    cin>>n>>m;
    for(int i = 1;i <= n;i++) cin>>value[i];
    for(int i = 1;i <= m;i++){
        cin>>t;
        card[t]++;
    }
    card[1]++;
    card[2]++;
    card[3]++;
    card[4]++;
    for(int i = 1;i <= card[1];i++){
        for(int j = 1;j <= card[2];j++){
            for(int k = 1;k <= card[3];k++){
                for(int l = 1;l <= card[4];l++){
                    dp[i][j][k][l] = max(max(dp[i][j][k][l-1],dp[i-1][j][k][l]),max(dp[i][j-1][k][l],dp[i][j][k-1][l])) + value[1 + 1*(i-1) + 2*(j-1) + 3*(k-1) + 4*(l-1)];
                }
            }
        }
    }
    cout<<dp[card[1]][card[2]][card[3]][card[4]];
    return 0;
}