Problem - Unique Paths

Given an $m \times n$ grid, count the number of paths from the top-left corner to the bottom-right corner. You can only move right or down.

Example: For a $3 \times 2$ grid (3 rows, 2 columns), there are 3 paths.

Think about this: how do you reach any cell in the grid?