DP – Matrix Ways from Top Left to Bottom Right

The number of rows R and columns C of a matrix are passed as the input. The program must print the number of ways W to traverse from the top left cell of the matrix to the bottom right cell of the matrix. From any given cell, the movement can be either to the right cell or the bottom cell.

Boundary Condition(s):
2 <= R, C <= 100

Input Format:
The first line contains R and C separated by a space.

Output Format:
The first line contains the number of ways W.

Example Input/Output 1:
Input:
2 2

Output:
2

Example Input/Output 2:
Input:
3 4

Output:
10

Example Input/Output 3:
Input:
20 15

Output:
818809200

def func(p,q):
    l=[1 for i in range(q)]
    for i in range(p-1):
        for j in range(1,q):
            l[j]+=l[j-1]
    return l[q-1]
p,q=map(int,input().split())
print(func(p,q))