python70分求优化

square = 0
rec = 0
n,m = map(int,input().split())
a = min(n,m)
i,j = 1,1
while i<=a and j<=a:
    square += (n+1-i)*(m+1-j)
    i += 1
    j += 1
l = 1
while l<=n:
    k = 1
    while k<=m:
        rec += (n+1-l)*(m+1-k)
        k += 1
    l += 1
print(square,rec-square)