def A(n):
res = 1
for i in range(1, n + 1):
res *= i
return res
def C(n, m):
if n < m:
return 0
return A(n) // A(m) // A(n - m)
n, m = [int(i) for i in raw_input().split()]
print A(n + 1) * 2 * m * C(n + 2, m - 1) * A(m - 1) + A(n + 1) * n * A(m) * C(n + 3, m)