

'''simple docstring'''





from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


A_	= {
    "configuration_luke": ["LUKE_PRETRAINED_CONFIG_ARCHIVE_MAP", "LukeConfig"],
    "tokenization_luke": ["LukeTokenizer"],
}

try:
				if not is_torch_available():
								raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
				pass
else:
				A_	= [
				    "LUKE_PRETRAINED_MODEL_ARCHIVE_LIST",
				    "LukeForEntityClassification",
				    "LukeForEntityPairClassification",
				    "LukeForEntitySpanClassification",
				    "LukeForMultipleChoice",
				    "LukeForQuestionAnswering",
				    "LukeForSequenceClassification",
				    "LukeForTokenClassification",
				    "LukeForMaskedLM",
				    "LukeModel",
				    "LukePreTrainedModel",
				]


if TYPE_CHECKING:
				from .configuration_luke import LUKE_PRETRAINED_CONFIG_ARCHIVE_MAP, LukeConfig
				from .tokenization_luke import LukeTokenizer

				try:
								if not is_torch_available():
												raise OptionalDependencyNotAvailable()
				except OptionalDependencyNotAvailable:
								pass
				else:
								from .modeling_luke import (
								    LUKE_PRETRAINED_MODEL_ARCHIVE_LIST,
								    LukeForEntityClassification,
								    LukeForEntityPairClassification,
								    LukeForEntitySpanClassification,
								    LukeForMaskedLM,
								    LukeForMultipleChoice,
								    LukeForQuestionAnswering,
								    LukeForSequenceClassification,
								    LukeForTokenClassification,
								    LukeModel,
								    LukePreTrainedModel,
								)

else:
				import sys

				A_	= _LazyModule(__name__, globals()["__file__"], _import_structure, module_spec=__spec__)





def    a      ( a	)     ->List[Any]:




			'''simple docstring'''


			SCREAMING_SNAKE_CASE     						= len(a	)
			while cur > 1:
						# Find the maximum number in arr
						SCREAMING_SNAKE_CASE     						= arr.index(max(arr[0:cur]	)	)
						# Reverse from 0 to mi
						SCREAMING_SNAKE_CASE     						= arr[mi::-1] + arr[mi + 1 : len(a	)]
						# Reverse whole list
						SCREAMING_SNAKE_CASE     						= arr[cur - 1 :: -1] + arr[cur : len(a	)]
						cur -= 1
			return arr


if __name__ == "__main__":
							__lowerCAmelCase					   =       input('Enter numbers separated by a comma:\n').strip()
							__lowerCAmelCase					   =       [int(item) for item in user_input.split(',')]
							print(pancake_sort(unsorted))