from math import inf
n, x, y = map(int, input().split())
t = lambda u : int(u)
events = [list(map(t, input().split())) for _ in range(n)]
v = list(map(t, input().split()))
w = list(map(t, input().split()))
v.sort()
w.sort()
for e in events:
    e.extend([-inf, inf])
#Nearest V for each event starting:
events.sort(key = lambda x : x[0]) #sort by start
vi, i = 0, 0
pvi = -inf
while vi < x and i < n:
    if v[vi] <= events[i][0]:
        events[i][2] = v[vi]
        pvi = v[vi]
        vi += 1
    else:
        events[i][2] = pvi
        i += 1
#Nearest W for each event ending:
events.sort(key = lambda x : x[1]) #sort by end

n = int(input())
gaps = []
for i in range(n):
    gaps.append(list(map(int, input().split())))
gaps.sort(key=lambda x: x[0])
ans = 1 #answer
prev = gaps[0][1]
i = 1 #current index
while i < n:
    if gaps[i][0] <= prev:
        prev = min(gaps[i][1], prev)
    else:
        ans += 1
        prev = gaps[i][1]
    i+=1
print(ans)

Here is my python solution. Note: "gaps" is the intervals array.