


'''simple docstring'''





from __future__ import annotations






def 						UpperCAmelCase__(				_SCREAMING_SNAKE_CASE					: list ):






			"""simple docstring"""




			if len(_SCREAMING_SNAKE_CASE ) == 0:
						return []
			__A,	__A=	min(_SCREAMING_SNAKE_CASE ), max(_SCREAMING_SNAKE_CASE )
			__A=	int(max_value - min_value ) + 1
			__A=	[[] for _ in range(_SCREAMING_SNAKE_CASE )]

			for i in my_list:
						buckets[int(i - min_value )].append(_SCREAMING_SNAKE_CASE )

			return [v for bucket in buckets for v in sorted(_SCREAMING_SNAKE_CASE )]


if __name__ == "__main__":
					from doctest import testmod

					testmod()
					assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
					assert bucket_sort([0, 1, -1_0, 1_5, 2, -2]) == [-1_0, -2, 0, 1, 2, 1_5]







'''simple docstring'''





def 						UpperCAmelCase__(				_SCREAMING_SNAKE_CASE					: int,_SCREAMING_SNAKE_CASE					: int,_SCREAMING_SNAKE_CASE					: int ):






			"""simple docstring"""




			if exponent == 1:
						return base
			if exponent % 2 == 0:
						__A=	_modexpt(_SCREAMING_SNAKE_CASE,exponent // 2,_SCREAMING_SNAKE_CASE ) % modulo_value
						return (x * x) % modulo_value
			else:
						return (base * _modexpt(_SCREAMING_SNAKE_CASE,exponent - 1,_SCREAMING_SNAKE_CASE )) % modulo_value






def 						UpperCAmelCase__(				_SCREAMING_SNAKE_CASE					: int = 1777,_SCREAMING_SNAKE_CASE					: int = 1855,_SCREAMING_SNAKE_CASE					: int = 8 ):






			"""simple docstring"""




			__A=	base
			for _ in range(1,_SCREAMING_SNAKE_CASE ):
						__A=	_modexpt(_SCREAMING_SNAKE_CASE,_SCREAMING_SNAKE_CASE,10**digits )

			return result


if __name__ == "__main__":
					print(F"""{solution() = }""")



