



"""simple docstring"""

def __lowercase    (							_a	,    _a					):
				snake_case_				:  Tuple       =			len(_a					)
				snake_case_				:  int       =			len(_a					)
				snake_case_				:  List[str]       =			[[False for _ in range(m + 1					)] for _ in range(n + 1					)]
				snake_case_				:  Any       =			True
				for i in range(_a					):
								for j in range(m + 1					):
												if dp[i][j]:
																if j < m and a[i].upper() == b[j]:
																				snake_case_				:  Dict       =			True
																if a[i].islower():
																				snake_case_				:  List[str]       =			True
				return dp[n][m]


if __name__ == "__main__":
					import doctest

					doctest.testmod()










"""simple docstring"""

def __lowercase    (							_a	,    _a					):
    snake_case_				:  str       =			[0 for i in range(r + 1					)]
    # nc0 = 1
    snake_case_				:  int       =			1
    for i in range(1	,    n + 1					):
        # to compute current row from previous row.
        snake_case_				:  Any       =			min(_a	,    _a					)
        while j > 0:
            c[j] += c[j - 1]
            j -= 1
    return c[r]






print(binomial_coefficient(n=10, r=5))





