A robot starts at the top-left of an m × n grid and moves only right or down. How many distinct paths reach the bottom-right?
Input: one line, two integers m n.
Output: the number of paths.
3 7
28
3 2
3
Run your code against the sample tests, or Submit to run the full suite.