#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cmath>

#include<queue>

#include<stack>

#include<vector>

#include<map>

#include<string>

#include<cstring>

using namespace std;

const int maxn=;

const int minn=-;

inline int read() {

    char c = getchar();

    int x = , f = ;

    while(c < '' || c > '') {

        if(c == '-') f = -;

        c = getchar();

    }

    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();

    return x * f;

}

int n,m,a[],f[][][][],s[],js[],b;

int main() {

    cin>>n>>m;

    for(int i=; i<=n; ++i) {

        a[i]=read();

    }

    for(int i=; i<=m; ++i) {

        cin>>b;

        js[b]++;

    }

     f[][][][]=a[];

    for(int i=; i<=js[]; ++i) {

        for(int j=; j<=js[]; ++j) {

            for(int k=; k<=js[]; ++k) {

                for(int l=; l<=js[]; ++l) {

                    int place=+i*+j*+k*+l*;

                    if(i!=) {

                        f[i][j][k][l]=max(f[i][j][k][l],f[i-][j][k][l]+a[place]);

                    }

                    if(j!=) {

                        f[i][j][k][l]=max(f[i][j][k][l],f[i][j-][k][l]+a[place]);

                    }

                    if(k!=) {

                        f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k-][l]+a[place]);

                    }

                    if(l!=) {

                        f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k][l-]+a[place]);

                    }

                }

            }

        }

    }

    cout<<f[js[]][js[]][js[]][js[]];

    return ;

}