#include using namespace std; int main(){ int N, A, C; cin >> N >> A; vector B(A); for(auto &&v:B)cin >> v; cin >> C; vector D(C); for(auto &&v:D)cin >> v; sort(B.rbegin(), B.rend()); sort(D.begin(), D.end()); atcoder::mcf_graph 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++){ g.add_edge(i, j + N, 1, B[i % A] <= D[j % C]); } } cout << N - g.flow(s, t).second << endl; }