Distinct Paths

There is a scholar on an m x n grid. The scholar is initially located at the top-left corner (i.e., grid[0][0]). The scholar tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The scholar can only move either down or right at any point in time.

Given the two integers m and n, return the number of possible distinct paths that the scholar can take to reach the bottom-right corner.