





'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      int    ,							lowercase						:      int						)	->	int:


				while a != 0:
								_a	,					_a								= b % a, a
				return b






def  _lowerCamelCase				( lowercase						:      int    ,							lowercase						:      int						)	->	int:


				if gcd(_A    ,							_A						) != 1:
								_a								= F'mod inverse of {a!r} and {m!r} does not exist'
								raise ValueError(_A						)
				_a	,					_a	,					_a								= 1, 0, a
				_a	,					_a	,					_a								= 0, 1, m
				while va != 0:
								_a								= ua // va
								_a	,					_a	,					_a	,					_a	,					_a	,					_a								= (ua - q * va), (ua - q * va), (ua - q * va), va, va, va
				return ua % m

'''simple docstring'''




from string import ascii_lowercase, ascii_uppercase






def 				snake_case__							(			_A:					str )    ->	str:

		'''simple docstring'''


		if not sentence:
				return ""
		lowerCAmelCase   					=  dict(zip(_A      ,   _A ) )
		return lower_to_upper.get(sentence[0]      ,   sentence[0] ) + sentence[1:]


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

						testmod()




