class Solution:
    def uniquePaths(self, m: int, n: int) -> int:
        dp = []
        for i in range(n):
            dp.append([0]*m)
        for i in range(m):
            dp[0][i] = 1
        for j in range(n):
            dp[j][0] = 1
        #print(dp)
        for i in range(1, n):
            for j in range(1, m):
                dp[i][j] = dp[i-1][j] + dp[i][j-1]
        return dp[-1][-1]

s = Solution()
result = s.uniquePaths(3,2)
print(result)