def count_perfect_square(H, W):
    total_count = 0
    max_k = min(H, W)
    for k in range(1, max_k + 1):
        total_count += (H - k + 1) * (W - k + 1)
    return total_count
H,W = list(map(int,input().split()))
print(count_perfect_square(H,W))