#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define LL long long

 #define rg register

 #define N 400

 using namespace std;

 int n,m,cnt[],f[][][][],a[N];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

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

     return k*f;

 }

 int main(){

     n=read(); m=read();

     for(rg int i=;i<=n;i++) a[i]=read();

     for(rg int i=;i<=m;i++) cnt[read()]++;

     for(rg int i=;i<=cnt[];i++)

         for(rg int j=;j<=cnt[];j++)

             for(rg int k=;k<=cnt[];k++)

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

                     int pos=i+(j<<)+(k*)+(l<<)+;

                     if(i>=)f[i][j][k][l]=max(f[i][j][k][l],f[i-][j][k][l]);

                     if(j>=)f[i][j][k][l]=max(f[i][j][k][l],f[i][j-][k][l]);

                     if(k>=)f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k-][l]);

                     if(l>=)f[i][j][k][l]=max(f[i][j][k][l],f[i][j][k][l-]);

                     f[i][j][k][l]+=a[pos];

                 }

     printf("%d\n",f[cnt[]][cnt[]][cnt[]][cnt[]]);

     return ;

 }