A robot starts in the top-left cell of an m x n grid. It can move only one step down or one step right at a time, and it wants to reach the bottom-right cell.

Return the number of distinct paths the robot can take to get from the start to the finish.