def countPaths(m, n): dp = [[0]*(n+1) for _ in range(m+1)] dp[0][0] = 1 for i in range(m+1): for j in range(n+1): if i > 0: dp[i][j] += dp[i-1][j] if j > 0: dp[i][j] += dp[i][j-1] if i > 0 and j > 0: dp[i][j] += dp[i-1][j-1] return dp[m][n] # 从标准输入读取m和n m, n = map(int, input().split()) # 计算并打印所有可能的路径数量 print(countPaths(m, n))