# n=1はおかしい
class SegTree:
    def __init__(self, op, e, n, v=None):
        self._n = n
        self._op = op
        self._e = e
        self._log = (n - 1).bit_length()
        self._size = 1 << self._log
        self._d = [self._e()] * (self._size << 1)
        if v is not None:
            for i in range(self._n):
                self._d[self._size + i] = v[i]
            for i in range(self._size - 1, 0, -1):
                self._d[i] = self._op(self._d[i << 1], self._d[i << 1 | 1])

    def set(self, p, x):
        p += self._size
        self._d[p] = x
        while p:
            l, r = p, p^1
            if l > r: l, r = r, l
            self._d[p >> 1] = self._op(self._d[l], self._d[r])
            p >>= 1

    def get(self, p):
        return self._d[p + self._size]

    #[l, r)の区間で求める
    def prod(self, l, r):
        sml, smr = self._e(), self._e()
        l += self._size
        r += self._size
        while l < r:
            if l & 1:
                sml = self._op(sml, self._d[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self._op(self._d[r], smr)
            l >>= 1
            r >>= 1
        return self._op(sml, smr)

    def all_prod(self):
        return self._d[1]

def op(x, y):
    return max(x, y)

def e():
    return (-1, -1)

import bisect
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
TC = [list(map(int, input().split())) for _ in range(M)]
ST = SegTree(op, e, N)
AB = []
for a, b in zip(A, B):
    AB.append((a, b))
AB.sort()
for i in range(N):
    a, b = AB[i]
    ST.set(i, (b, i))

TC.sort(key=lambda x:x[1])
U = []
V = []
for t, c in TC:
    if t==0:
        U.append(c)
    else:
        V.append(c)

INF = 10**10
for c in U:
    pos = bisect.bisect_right(AB, (c, INF))
    b, i = ST.prod(0, pos)
    if i!=-1:
        ST.set(i, (-1, -1))

BB = []
for i in range(N):
    b, _ = ST.get(i)
    if b!=-1:
        BB.append(b)
BB.sort(reverse=True)
#print(BB)
for c in V:
    if BB and BB[-1]<=c:
        BB.pop()

print(len(BB))