


def 							_lowercase    (		SCREAMING_SNAKE_CASE_   :		Any       ,  SCREAMING_SNAKE_CASE_   :		Any       ,  SCREAMING_SNAKE_CASE_   :		Optional[Any]       ,  SCREAMING_SNAKE_CASE_   :		Union[str, Any]       ,  SCREAMING_SNAKE_CASE_   :		List[Any]       ,  SCREAMING_SNAKE_CASE_   :		Union[str, Any]	):





			"""simple docstring"""




			if index == r:
						for j in range(SCREAMING_SNAKE_CASE_	):
									print(data[j]       ,  end=""" """	)
						print(""" """	)
						return
			#  When no more elements are there to put in data[]
			if i >= n:
						return
			# current is included, put next at next location
			UpperCamelCase         =					arr[i]
			combination_util(SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  index + 1       ,  SCREAMING_SNAKE_CASE_       ,  i + 1	)
			# current is excluded, replace it with
			# next (Note that i+1 is passed, but
			# index is not changed)
			combination_util(SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  i + 1	)
			# The main function that prints all combinations
			# of size r in arr[] of size n. This function
			# mainly uses combinationUtil()






def 							_lowercase    (		SCREAMING_SNAKE_CASE_   :		int       ,  SCREAMING_SNAKE_CASE_   :		Any       ,  SCREAMING_SNAKE_CASE_   :		List[Any]	):





			"""simple docstring"""




			UpperCamelCase         =					[0] * r
			# Print all combination using temporary array 'data[]'
			combination_util(SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_       ,  0       ,  SCREAMING_SNAKE_CASE_       ,  0	)


if __name__ == "__main__":
			# Driver code to check the function above
			__snake_case            =   [10, 20, 30, 40, 50]
			print_combination(arr, len(arr), 3)
			# This code is contributed by Ambuj sahu








def 							_lowercase    (		SCREAMING_SNAKE_CASE_   :		int	):





			"""simple docstring"""




			assert (
			    isinstance(SCREAMING_SNAKE_CASE_       ,  SCREAMING_SNAKE_CASE_	) and number_of_steps > 0
			), f'number_of_steps needs to be positive integer, your input {number_of_steps}'
			if number_of_steps == 1:
						return 1
			UpperCamelCase  ,  UpperCamelCase         =					1, 1
			for _ in range(number_of_steps - 1	):
						UpperCamelCase  ,  UpperCamelCase         =					current + previous, current
			return current


if __name__ == "__main__":
			import doctest

			doctest.testmod()




