import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
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 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import Counter

def sol():
    cnt=Counter()
    for (a,b),p in zip(ab,pp):
        for c,d in cd:
            x=a-c
            y=b-d
            cnt[x,y]+=p
    return max(cnt.values())

n,m=LI()
pp=LI()
ab=LLI(n)
cd=LLI(m)
ans=max(0,sol())
ab=[(-a,b) for a,b in ab]
ans=max(ans,sol())
ab=[(a,-b) for a,b in ab]
ans=max(ans,sol())
ab=[(-a,b) for a,b in ab]
ans=max(ans,sol())
print(ans)