from __future__ import annotations






def 							__UpperCAmelCase     (							UpperCAmelCase							)->							Tuple:



			"""simple docstring"""







			create_state_space_tree(lowercase__,		[],		0,		[0 for i in range(len(lowercase__							)							)]							)






def 							__UpperCAmelCase     (							UpperCAmelCase,		UpperCAmelCase,		UpperCAmelCase,		UpperCAmelCase,		)->							int:



			"""simple docstring"""







			if index == len(lowercase__							):
						print(lowercase__							)
						return

			for i in range(len(lowercase__							)							):
						if not index_used[i]:
									current_sequence.append(sequence[i]							)
									lowercase       		=		True
									create_state_space_tree(lowercase__,		lowercase__,		index + 1,		lowercase__							)
									current_sequence.pop()
									lowercase       		=		False
A_	     =   [3, 1, 2, 4]
generate_all_permutations(sequence)

A_	     =   ["A", "B", "C"]




generate_all_permutations(sequence_a)








'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	List[str],       lowercase__    :	Tuple			):






     '''simple docstring'''





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







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


