import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(1000005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = -1-(-1 << 63) # md = 10**9+7 md = 998244353 from heapq import * n,m=LI() aa=LI() bb=LI() ua=sorted(enumerate(aa),key=lambda x:-x[1]) cc=[[],[]] for _ in range(m): t,c=LI() cc[t].append(c) cc[0].sort() cc[1].sort() hp=[] for c in cc[0]: while ua and ua[-1][1]<=c: u,a=ua.pop() hp.append(-bb[u]) if hp:heappop(hp) hp=[-b for b in hp] heapify(hp) for c in cc[1]: if hp and hp[0]<=c:heappop(hp) print(len(hp))