We have N+M balls, each of which has an integer written on it.
It is known that:

• The numbers written on N of the balls are even.
• The numbers written on M of the balls are odd.

Find the number of ways to choose two of the N+M balls (disregarding order) so that the sum of the numbers written on them is even.
It can be shown that this count does not depend on the actual values written on the balls.

Constraints

• $0 \leq N,M \leq 100$
• $2 \leq N+M$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N M

Output

Print the answer.

Examples

Input

2 1

Output

1

Input

4 3

Output

9

Input

1 1

Output

0

Input

13 3

Output

81

Input

0 3

Output

3

见题面

见题面