#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;
#define M 60
int N, A, B, a[M], a2[M], b[M];

int main(){
	cin>>N;
	cin>>A;
	for(int i = 0; i < A; i++) cin>>a[i];
	cin>>B;
	for(int i = 0; i < B; i++) cin>>b[i];
	sort(a, a+A); sort(b, b+B);
	int res = 0;
	for(int i = 0; i < N; i++){
		if(!(i%A)) memcpy(a2, a, sizeof(a));
		int c = b[i%B];
		int pos = -1;
		for(int j = 0; j <= A; j++){
			if(j==A){
				a2[pos] = 0;
				break;
			}
			if(pos<0 && a2[j]) pos = j;
			if(a2[j]>c){
				a2[j] = 0;
				res++;
				break;
			}
		}
	}
	cout<<res<<endl;
	return 0;
}