eolymp
Problems

Clever turtle

Clever turtle

prb1704 There is a field of cellular size m × n. The turtle sits in the lower left corner. It can go only right or up. Before getting to the top right corner, it is interested in the question: how many ways are there to get from the origin to the upper right corner?

Although the turtle is clever, it can't count so much. Help the turtle to find an answer to your question.

Input

Two positive integers m and n not exceeding 30.

Output

Print the number of ways to get from the lower left corner to the upper right one.

Time limit 1 second
Memory limit 128 MiB
Input example #1
4 3
Output example #1
10