#include<atcoder/all>
using namespace std;

int main(){
    int N, A, C;
    cin >> N >> A;
    vector<int> B(A);
    for(auto &&v:B)cin >> v;
    cin >> C;
    vector<int> D(C), pos1, pos2;
    for(auto &&v:D)cin >> v;
    sort(B.rbegin(), B.rend());
    sort(D.begin(), D.end());
    vector<vector<bool>> M(50, vector<bool>(50));
    for(int i = 0; i < N; i++)M[i / A][i / C] = true;
    atcoder::mcf_graph<int, int> g(2 * N + 2);
    int s = 2 * N, t = s + 1;
    for(int i = 0; i < N; i++){
        g.add_edge(s, i, 1, 0);
        g.add_edge(i + N, t, 1, 0);
        for(int j = 0; j < N; j++){
            if(!M[i / A][j / C])continue;
            g.add_edge(i, j + N, 1, B[i % A] <= D[j % C]);
        }
    }
    cout << N - g.flow(s, t).second << endl;
}