A robot is located at the top-left corner of an m x n grid. It can only move either down or right at any point in time, trying to reach the bottom-right corner. Return the number of possible unique paths.
Example:
Input: m = 3, n = 7
Output: 28
Constraints:
1 <= m, n <= 100