''' 解题思路: f(m,n)表示将m个苹果放入n个盘子中的摆放方法总数, 放苹果分为两种情况,一种是有1个盘子为空 f(m,n-1),另一种是每个盘子上至少有1个苹果f(m-n,n), 递推关系:f(m,n) = f(m,n-1) + f(m-n,n) 边界条件:当m==1 or n==1时,f(m,n) =1 ''' def f(m,n): if m<0 or n<0: return 0 elif m==1 or n==1: return 1 else: return f(m,n-1) + f(m-n,n) while 1: try: m,n = map(int,input().strip().split()) print(f(m,n)) except: break