AddingSquares.py

def fun(X, Y, N, M):
    m1 = {}
    m2 = {}
    ans = 0
    for i in range(0, N):
        for j in range(i + 1, N):
            dist = abs(X[i] - X[j])
            if dist in m1:
                m1[dist] = m1[dist] + 1
            else:
                m1[dist] = 1
 
    for i in range(0, M):
        for j in range(i + 1, M):
            dist = abs(Y[i] - Y[j])
            if dist in m2:
                m2[dist] = m2[dist] + 1
            else:
                m2[dist] = 1
    for key in m1:
        if key in m2:
            ans +=1 
    return ans

l=list(map(int,input().split()))
w=l[0]
h=l[1]
n=l[2]
m=l[3]
A=list(map(int,input().split()))
B=list(map(int,input().split()))
t=fun(A,B,len(A),len(B))
temp=[]
for i in range(1,h+1):
    if i not in B:
        B.append(i)
        temp.append(fun(A,B,len(A),len(B))-t)
        B.remove(i)
print(max(temp)+t)