import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
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 = 10**20
# md = 998244353
md = 10**9+7

n = II()
cs = []
lr = []
for i in range(5):
    l, r, *aa = LI()
    l, r = l-1, r-1
    lr.append((l, r))
    s = [0]
    for a in aa: s.append(s[-1]+a)
    cs.append(s)

ss = [[] for _ in range(5)]
for _ in range(II()):
    i, s = LI()
    ss[i-1].append(s)
for i in range(5):ss[i].sort()

ans = 0
for j in range(5):
    l1, r1 = lr[j]
    for i in range(j):
        l0, r0 = lr[i]
        l = max(l0, l1)
        r = min(r0, r1)
        if l>r:continue
        u = v = 0
        d = cs[j][l-l1]-cs[i][l-l0]
        e = cs[j][r-l1]-cs[i][r-l0]
        for s in ss[j]:
            while u < len(ss[i]) and s+d > ss[i][u]: u += 1
            if u==len(ss[i]):break
            while v < len(ss[i]) and s+e >= ss[i][v]: v += 1
            ans += v-u

print(ans)