


UpperCamelCase			:					dict[str, float]         =							{
    "kilogram": 1,
    "gram": pow(10, 3),
    "milligram": pow(10, 6),
    "metric-ton": pow(10, -3),
    "long-ton": 0.0_0_0_9_8_4_2_0_7_3,
    "short-ton": 0.0_0_1_1_0_2_3_1_2_2,
    "pound": 2.2_0_4_6_2_4_4_2_0_2,
    "stone": 0.1_5_7_4_7_3_1_7_2_8,
    "ounce": 3_5.2_7_3_9_9_0_7_2_3,
    "carrat": 5_000,
    "atomic-mass-unit": 6.0_22_13_66_52E26,
}

UpperCamelCase			:					dict[str, float]         =							{
    "kilogram": 1,
    "gram": pow(10, -3),
    "milligram": pow(10, -6),
    "metric-ton": pow(10, 3),
    "long-ton": 1_016.04_608,
    "short-ton": 9_0_7.1_8_4,
    "pound": 0.4_5_3_5_9_2,
    "stone": 6.3_5_0_2_9,
    "ounce": 0.0_2_8_3_4_9_5,
    "carrat": 0.0_0_0_2,
    "atomic-mass-unit": 1.6_60_54_01_99E-27,
}
def 				UpperCamelCase_	(					__snake_case      :    str						,      __snake_case      :    str						,      __snake_case      :    float  )->   float:




						'''simple docstring'''






						if to_type not in KILOGRAM_CHART or from_type not in WEIGHT_TYPE_CHART:
												__magic_name__					=      (
												    F'''Invalid \'from_type\' or \'to_type\' value: {from_type!r}, {to_type!r}\n'''
												    F'''Supported values are: {", ".join(__snake_case  )}'''
												)
												raise ValueError(__snake_case  )
						return value * KILOGRAM_CHART[to_type] * WEIGHT_TYPE_CHART[from_type]


if __name__ == "__main__":
					import doctest

					doctest.testmod()








def _a							(      lowerCamelCase:  list					)      ->		list:







      '''simple docstring'''






      __A			  =							len(lowerCamelCase					)
      for cycle_start in range(0   ,							array_len - 1					):
            __A			  =							array[cycle_start]

            __A			  =							cycle_start
            for i in range(cycle_start + 1   ,							lowerCamelCase					):
                  if array[i] < item:
                        pos += 1

            if pos == cycle_start:
                  continue

            while item == array[pos]:
                  pos += 1

            __A  ,		__A			  =							item, array[pos]
            while pos != cycle_start:
                  __A			  =							cycle_start
                  for i in range(cycle_start + 1   ,							lowerCamelCase					):
                        if array[i] < item:
                              pos += 1

                  while item == array[pos]:
                        pos += 1

                  __A  ,		__A			  =							item, array[pos]

      return array


if __name__ == "__main__":
       assert cycle_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
       assert cycle_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]





