题解 | #走方格的方案数#

def Roadcount(n, m):
    if n == 1 and m == 1:
        return 2
    elif n == 1 and m > 1:
        return 1+Roadcount(n, m-1)
    elif n > 1 and m == 1:
        return 1+Roadcount(n-1, m)
    else:
        return Roadcount(n-1, m)+Roadcount(n, m-1)

while 1:
    try:
        n, m = map(int, input().split(' '))
        print(Roadcount(n, m))
    except:
        break