





from string import ascii_uppercase

UpperCAmelCase_      							=     {str(ord(c) - 55): c for c in ascii_uppercase}





def 						lowerCamelCase__     (     UpperCamelCase__			:       int       ,    UpperCamelCase__			:       int						)			-> str:



					'''simple docstring'''




					if isinstance(UpperCamelCase__       ,    UpperCamelCase__						):
										raise TypeError('int() can\'t convert non-string with explicit base'						)
					if num < 0:
										raise ValueError('parameter must be positive int'						)
					if isinstance(UpperCamelCase__       ,    UpperCamelCase__						):
										raise TypeError('\'str\' object cannot be interpreted as an integer'						)
					if isinstance(UpperCamelCase__       ,    UpperCamelCase__						):
										raise TypeError('\'float\' object cannot be interpreted as an integer'						)
					if base in (0, 1):
										raise ValueError('base must be >= 2'						)
					if base > 36:
										raise ValueError('base must be <= 36'						)
					_snake_case									=				''
					_snake_case									=				0
					_snake_case									=				0
					while div != 1:
										_snake_case							,     _snake_case									=				divmod(UpperCamelCase__       ,    UpperCamelCase__						)
										if base >= 11 and 9 < mod < 36:
															_snake_case									=				ALPHABET_VALUES[str(UpperCamelCase__						)]
										else:
															_snake_case									=				str(UpperCamelCase__						)
										new_value += actual_value
										_snake_case									=				num // base
										_snake_case									=				div
										if div == 0:
															return str(new_value[::-1]						)
										elif div == 1:
															new_value += str(UpperCamelCase__						)
															return str(new_value[::-1]						)

					return new_value[::-1]


if __name__ == "__main__":
					import doctest

					doctest.testmod()

					for base in range(2, 37):
										for num in range(1000):
															assert int(decimal_to_any(num, base), base) == num, (
															    num,
															    base,
															    decimal_to_any(num, base),
															    int(decimal_to_any(num, base), base),
															)










def 						lowerCamelCase__     (     UpperCamelCase__			:       List[Any]       ,    UpperCamelCase__			:       Dict       ,    UpperCamelCase__			:       str       ,    UpperCamelCase__			:       int       ,    UpperCamelCase__			:       List[str]       ,    UpperCamelCase__			:       str						)			-> List[Any]:



					'''simple docstring'''




					if index == r:
										for j in range(UpperCamelCase__						):
															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
					_snake_case									=				arr[i]
					combination_util(UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__       ,    index + 1       ,    UpperCamelCase__       ,    i + 1						)
					# current is excluded, replace it with
					# next (Note that i+1 is passed, but
					# index is not changed)
					combination_util(UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__       ,    UpperCamelCase__       ,    i + 1						)
					# The main function that prints all combinations
					# of size r in arr[] of size n. This function
					# mainly uses combinationUtil()





def 						lowerCamelCase__     (     UpperCamelCase__			:       Optional[int]       ,    UpperCamelCase__			:       Tuple       ,    UpperCamelCase__			:       List[str]						)			-> Tuple:



					'''simple docstring'''




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


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



