def numTrees(n): return c(2 * n, n) / (n + 1)
def uniquePaths(m, n): return c(n+m-2, m-1)
def numTrees(n): return c(2*n, n)//(n+1)
def uniquePaths(m, n): return c(n + m - 2, m - 1)