#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);
    for(auto &&v:D)cin >> v;
    sort(B.rbegin(), B.rend());
    sort(D.begin(), D.end());
    atcoder::mf_graph<int> g(A + C + 2);
    int s = A + C, t = s + 1, INF = 1 << 20;
    for(int i = 0; i < A; i++){
        g.add_edge(s, i, N / A + (i < N % A));
        int j = lower_bound(D.begin(), D.end(), B[i]) - D.begin();
        if(j)g.add_edge(i, A + j - 1, INF);
    }
    for(int i = 0; i < C; i++){
        g.add_edge(A + i, t, N / C + (i < N % C));
        if(i)g.add_edge(A + i, A + i - 1, INF);
    }
    cout << g.flow(s, t) << endl;
}