Clever turtle#1704
A grid of size m \times n is given. A turtle is located in the bottom-left corner and can move only to the right or up. Before reaching the top-right corner, the turtle wondered: how many different ways are there to get from the starting point to the top-right corner?
Although the turtle is clever, it cannot yet calculate such a large number of possibilities on its own. Help the turtle find the answer to its question.
Two positive integers and , each not exceeding .
Output the number of ways the turtle can reach the top-right corner from the bottom-left corner.
Example 1