棋盘方格（3月29日）

---

数学问题，找到规律后，发现最大的正方形是由最短边决定的
当最短边为min(n, m)时，边长为min(n, m)的正方形有(min(n, m) - 1) * (min(n, m) - 1)个
··································边长为min(n, m) - 1的正方形有(min(n, m) - 2) * (min(n, m) - 2)个
··································边长为min(n, m) - 2的正方形有(min(n, m) - 3) * (min(n, m) - 3)个
··································以此类推，可以得出正方形的个数
接下来只要得出正方形和长方形的总个数减去正方形个数就是长方形个数了
(因为得出总个数比单独求长方形要简洁)
将长度不同的长方形个数总结一下
根据乘法原理
总个数为(n * m * (n + 1) * (m + 1))

---

# 找规律
n, m = map(int, input().split())
sum_z = 0
for i in range(min(n, m) - 1, -1, -1):
    sum_z += (n - i) * (m - i)
print(f'{sum_z} {int(((n * m * (n + 1) * (m + 1)) / 4) - sum_z)}')