





def     _UpperCamelCase     (a__   :int   ,			a__   :int   ,			a__   :int       ):






							"""simple docstring"""





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





def     _UpperCamelCase     (a__   :int = 1777   ,			a__   :int = 1855   ,			a__   :int = 8       ):






							"""simple docstring"""





							UpperCamelCase__				     =			base
							for _ in range(1   ,			a__       ):
														UpperCamelCase__				     =			_modexpt(a__   ,			a__   ,			10**digits       )

							return result


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











from typing import Any





def     _UpperCamelCase     (a__   :list       ):






							"""simple docstring"""





							if not input_list:
														return []
							UpperCamelCase__				     =			[input_list.count(a__       ) for value in input_list]
							UpperCamelCase__				     =			max(a__       )  # Gets the maximum count in the input list.
							# Gets values of modes
							return sorted({input_list[i] for i, value in enumerate(a__       ) if value == y}       )


if __name__ == "__main__":
					import doctest

					doctest.testmod()




