

from math import factorial

def 		UpperCamelCase      (lowercase_:				int					,   lowercase_:				int      )  ->   int:

	# If either of the conditions are true, the function is being asked
	# to calculate a factorial of a negative number, which is not possible
	if n < k or k < 0:
		raise ValueError("""Please enter positive integers for n and k where n >= k"""      )
	return factorial(lowercase_      ) // (factorial(lowercase_      ) * factorial(n - k      ))


if __name__ == "__main__":
	print(
	    'The number of five-card hands possible from a standard',
	    f'''fifty-two card deck is: {combinations(52, 5)}\n''',
	)

	print(
	    'If a class of 40 students must be arranged into groups of',
	    f'''4 for group projects, there are {combinations(40, 4)} ways''',
	    'to arrange them.\n',
	)

	print(
	    'If 10 teams are competing in a Formula One race, there',
	    f'''are {combinations(10, 3)} ways that first, second and''',
	    'third place can be awarded.',
	)






def 		UpperCamelCase      (lowercase_:				str					,   lowercase_:				str      )  ->   bool:
	A__							:					Union[str, Any]       =	len(lowercase_      )
	A__							:					List[Any]       =	len(lowercase_      )
	A__							:					List[Any]       =	[[False for _ in range(m + 1      )] for _ in range(n + 1      )]
	A__							:					str       =	True
	for i in range(lowercase_      ):
		for j in range(m + 1      ):
			if dp[i][j]:
				if j < m and a[i].upper() == b[j]:
					A__							:					int       =	True
				if a[i].islower():
					A__							:					Dict       =	True
	return dp[n][m]


if __name__ == "__main__":
	import doctest

	doctest.testmod()



