




"""simple docstring"""



SCREAMING_SNAKE_CASE				=       {
    "meter": "m",
    "kilometer": "km",
    "megametre": "Mm",
    "gigametre": "Gm",
    "terametre": "Tm",
    "petametre": "Pm",
    "exametre": "Em",
    "zettametre": "Zm",
    "yottametre": "Ym",
}
# Exponent of the factor(meter)
SCREAMING_SNAKE_CASE				=       {
    "m": 0,
    "km": 3,
    "Mm": 6,
    "Gm": 9,
    "Tm": 12,
    "Pm": 15,
    "Em": 18,
    "Zm": 21,
    "Ym": 24,
}







def   _SCREAMING_SNAKE_CASE   (							lowercase_			, lowercase_			, lowercase_						)						->		float:
 A__       =				from_type.lower().strip("s"						)
 A__       =				to_type.lower().strip("s"						)

 A__       =				UNIT_SYMBOL.get(UpperCAmelCase__			, UpperCAmelCase__						)
 A__       =				UNIT_SYMBOL.get(UpperCAmelCase__			, UpperCAmelCase__						)

 if from_sanitized not in METRIC_CONVERSION:
  A__       =				(
      f"""Invalid \'from_type\' value: {from_type!r}.\n"""
      f"""Conversion abbreviations are: {", ".join(UpperCAmelCase__						)}"""
  )
  raise ValueError(UpperCAmelCase__						)
 if to_sanitized not in METRIC_CONVERSION:
  A__       =				(
      f"""Invalid \'to_type\' value: {to_type!r}.\n"""
      f"""Conversion abbreviations are: {", ".join(UpperCAmelCase__						)}"""
  )
  raise ValueError(UpperCAmelCase__						)
 A__       =				METRIC_CONVERSION[from_sanitized]
 A__       =				METRIC_CONVERSION[to_sanitized]
 A__       =				1

 if from_exponent > to_exponent:
  A__       =				from_exponent - to_exponent
 else:
  A__       =				-(to_exponent - from_exponent)

 return value * pow(10			, UpperCAmelCase__						)


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

      testmod()






'''simple docstring'''




def 							lowerCamelCase	(      UpperCAmelCase__       :					list )			->      list:
							if any(not isinstance(UpperCAmelCase__      ,      UpperCAmelCase__ ) or x < 0 for x in sequence ):
														raise TypeError("""Sequence must be list of non-negative integers""" )
							for _ in range(len(UpperCAmelCase__ ) ):
														for i, (rod_upper, rod_lower) in enumerate(zip(UpperCAmelCase__      ,      sequence[1:] ) ):
																					if rod_upper > rod_lower:
																												sequence[i] -= rod_upper - rod_lower
																												sequence[i + 1] += rod_upper - rod_lower
							return sequence


if __name__ == "__main__":
						assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
						assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]





