#include <iostream>

 using namespace std;

 const int MAXN = ;

 int dp[][][][], a[], v[MAXN];

 int main(void){

     int n, m, x;

     cin >> n >> m;

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

         cin >> v[i];

     }

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

         cin >> x;

         a[x]++;

     }

     dp[][][][] = v[];

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

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

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

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

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

                     if(i) dp[i][j][k][l] = max(dp[i][j][k][l], dp[i - ][j][k][l] + v[dis]);

                     if(j) dp[i][j][k][l] = max(dp[i][j][k][l], dp[i][j - ][k][l] + v[dis]);

                     if(k) dp[i][j][k][l] = max(dp[i][j][k][l], dp[i][j][k - ][l] + v[dis]);

                     if(l) dp[i][j][k][l] = max(dp[i][j][k][l], dp[i][j][k][l - ] + v[dis]);

                 }

             }

         }

     }

     cout << dp[a[]][a[]][a[]][a[]] << endl;

     return ;

 }