Unique Paths in a Grid

Given an (m \times n) grid, determine the number of unique paths from the top-left corner to the bottom-right corner. You can only move either down or right at any point in time. The number of unique paths is mathematically given by the formula: (\binom{m+n-2}{m-1}).

inputFormat

The input consists of two space-separated integers, (m) and (n), which represent the number of rows and columns of the grid, respectively.

outputFormat

Output a single integer that denotes the number of unique paths from the top-left corner to the bottom-right corner of the grid.## sample

2 3

3