import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N = NI()
    A = NI()
    B = NLI()
    C = NI()
    D = NLI()
    B.sort(reverse=True)
    l, r = divmod(N, A)
    B = B * l + B[:r]
    D.sort(reverse=True)
    ans = 0
    X = D[:]
    for b in B:
        if b <= min(X):
            X.pop(0)
        else:
            idx = 0
            for i, d in enumerate(X):
                if d < b:
                    idx = i
                    break
            ans += 1
            X.pop(idx)
        if len(X) == 0:
            X = D[:]
    print(ans)


if __name__ == "__main__":
    main()