Implement `uniquePaths(m, n)` returning the number of distinct paths from the top-left to the bottom-right of an `m` by `n` grid, moving only right or down.
Run your code to see results.