// vijos2.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
#include <stdlib.h>
#include <string>
#include <list>
#include <vector>
#include "math.h"
#include <map>
#include <iterator>
#include <bitset>
#include <set>
#include <deque>
#include <stack>
#include <algorithm>

using namespace std;
int work(int,int,int,int,list<int>,int);
int main()
{
list<int> score;
int A, B=0, C=0, D=0,t;
int maxscore;
int N,M;
cin >> N >> M;
for (maxscore = 0;maxscore < N;maxscore++)
{
cin >> A;
score.push_back(A);
}
A = 0;
for (maxscore = 0;maxscore <M;maxscore++)
{
cin >> t;
switch (t){
case (1) :
A++;
break;
case (2) :
B++;
break;
case (3) :
C++;
break;
case (4) :
D++;
}
}
maxscore = 0;
cout << work(A,B,C,D,score,0);
return 0;
}
int max(int a, int b)
{
return (a > b ? a : b);
}
int work(int A, int B, int C, int D, list<int> score,int loc) {
list<int>::iterator ite;
ite = score.begin();
if ((A == 0) && (B == 0) && (C == 0) && (D == 0))
{
ite = score.end();
ite--;
return (ite);
}
int a, b, c, d;
if (A > 0)a = work(A-1,B,C,D,score,loc+1);else a = 0;
if (B > 0)b = work(A, B - 1, C, D, score, loc + 2);else b = 0;
if (C > 0)c = work(A, B, C - 1, D, score, loc + 3);else c = 0;
if (D > 0)d = work(A, B, C, D - 1, score, loc + 4);else d = 0;
int t;
for (t = 0;t < loc;t++)
ite++;
return (max(a, max(b, max(c, d)))) + ((ite ));
}