import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int A;
int[] B;
int C;
int[] D;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = readInt();
      B = new int[A];
      foreach (a; 0 .. A) {
        B[a] = readInt();
      }
      C = readInt();
      D = new int[C];
      foreach (c; 0 .. C) {
        D[c] = readInt();
      }
      
      int ans;
      auto cntA = new int[A];
      auto cntC = new int[C];
      foreach (i; 0 .. N) {
        int a0 = -1, c0 = -1;
        if (i / A * A + A <= i / C * C + C) {
          foreach_reverse (a; 0 .. A) {
            if (cntA[a] == i / A) {
              a0 = a;
              break;
            }
          }
          assert(a0 != -1);
          foreach_reverse (c; 0 .. C) {
            if (cntC[c] == i / C) {
              if (B[a0] > D[c]) {
                c0 = c;
                break;
              }
            }
          }
          if (c0 == -1) {
            foreach_reverse (c; 0 .. C) {
              if (cntC[c] == i / C) {
                c0 = c;
                break;
              }
            }
          }
          assert(c0 != -1);
        } else {
          foreach (c; 0 .. C) {
            if (cntC[c] == i / C) {
              c0 = c;
              break;
            }
          }
          assert(c0 != -1);
          foreach (a; 0 .. A) {
            if (cntA[a] == i / A) {
              if (B[a] > D[c0]) {
                a0 = a;
                break;
              }
            }
          }
          if (a0 == -1) {
            foreach (a; 0 .. A) {
              if (cntA[a] == i / A) {
                a0 = a;
                break;
              }
            }
          }
          assert(a0 != -1);
        }
        debug {
          writeln(a0, " ", c0);
        }
        if (B[a0] > D[c0]) {
          ++ans;
        }
        ++cntA[a0];
        ++cntC[c0];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}