#include <bits/stdc++.h> using namespace std; int n, m, t[350]; int g[5]; long long dp[45][45][45][45]; // dp[a][b][c][d] : 用a张1, b张2, c张3, d张4 int main() { cin >> n >> m; for(int i = 1; i <= n; i++) { cin >> t[i]; } for(int i = 1; i <= m; i++) { int x; cin >> x; g[x]++; } dp[0][0][0][0] = t[1]; for(int a = 0; a <= g[1]; a++) for(int b = 0; b <= g[2]; b++) for(int c = 0; c <= g[3]; c++) for(int d = 0; d <= g[4]; d++) { int sum = 1 + a * 1 + b * 2 + c * 3 + d * 4; if(a != 0) dp[a][b][c][d] = max(dp[a][b][c][d], dp[a - 1][b][c][d] + t[sum]); if(b != 0) dp[a][b][c][d] = max(dp[a][b][c][d], dp[a][b - 1][c][d] + t[sum]); if(c != 0) dp[a][b][c][d] = max(dp[a][b][c][d], dp[a][b][c - 1][d] + t[sum]); if(d != 0) dp[a][b][c][d] = max(dp[a][b][c][d], dp[a][b][c][d - 1] + t[sum]); } cout << dp[g[1]][g[2]][g[3]][g[4]]; return 0; }