# Clever turtle

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

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.

## Examples

Input #1

Answer #1

Submissions 9K

Acceptance rate 46%