



_lowercase: Dict      			=		[
    (1000, "M"),
    (900, "CM"),
    (500, "D"),
    (400, "CD"),
    (100, "C"),
    (90, "XC"),
    (50, "L"),
    (40, "XL"),
    (10, "X"),
    (9, "IX"),
    (5, "V"),
    (4, "IV"),
    (1, "I"),
]






def     a(      A       :    str       )		->       int:
					"""simple docstring"""





					a					     =   {"I": 1, "V": 5, "X": 10, "L": 50, "C": 100, "D": 500, "M": 1000}
					a					     =   0
					a					     =   0
					while place < len(A       ):
										if (place + 1 < len(A       )) and (vals[roman[place]] < vals[roman[place + 1]]):
															total += vals[roman[place + 1]] - vals[roman[place]]
															place += 2
										else:
															total += vals[roman[place]]
															place += 1
					return total






def     a(      A       :    int       )		->       str:
					"""simple docstring"""





					a					     =   []
					for arabic, roman in ROMAN:
										((a)     ,				(a))					     =   divmod(A ,     A       )
										result.append(roman * factor       )
										if number == 0:
															break
					return "".join(A       )


if __name__ == "__main__":
				import doctest

				doctest.testmod()





import random






def     a(      A       :    Optional[Any] ,     A       :    Optional[Any] ,     A       :    str       )		->       List[Any]:
					"""simple docstring"""





					a					     =   a[left_index]
					a					     =   left_index + 1
					for j in range(left_index + 1 ,     A       ):
										if a[j] < pivot:
															a     ,				a					     =   a[i], a[j]
															i += 1
					a     ,				a					     =   a[i - 1], a[left_index]
					return i - 1






def     a(      A       :    List[Any] ,     A       :    List[Any] ,     A       :    Union[str, Any]       )		->       List[Any]:
					"""simple docstring"""





					if left < right:
										a					     =   random.randint(A ,     right - 1       )
										a     ,				a					     =   (
										    a[left],
										    a[pivot],
										)  # switches the pivot with the left most bound
										a					     =   partition(A ,     A ,     A       )
										quick_sort_random(
										    A ,     A ,     A       )  # recursive quicksort to the left of the pivot point
										quick_sort_random(
										    A ,     pivot_index + 1 ,     A       )  # recursive quicksort to the right of the pivot point






def     a(      )		->       Any:
					"""simple docstring"""





					a					     =   input("Enter numbers separated by a comma:\n"       ).strip()
					a					     =   [int(A       ) for item in user_input.split(","       )]

					quick_sort_random(A ,     0 ,     len(A       )       )

					print(A       )


if __name__ == "__main__":
				main()
