





def      _A       (		SCREAMING_SNAKE_CASE     :   int = 3       ,       SCREAMING_SNAKE_CASE     :   int = 7       ,       SCREAMING_SNAKE_CASE     :   int = 1_000_000						):





  """simple docstring"""



  a__	:					List[str]										=0
  a__	:					Dict										=1

  for current_denominator in range(1       ,       limit + 1						):
    a__	:					Union[str, Any]										=current_denominator * numerator // denominator
    if current_denominator % denominator == 0:
      current_numerator -= 1
    if current_numerator * max_denominator > current_denominator * max_numerator:
      a__	:					Any										=current_numerator
      a__	:					Tuple										=current_denominator
  return max_numerator


if __name__ == "__main__":
     print(solution(numerator=3, denominator=7, limit=1000000))













def      _A       (		SCREAMING_SNAKE_CASE     :   Optional[Any]						):





  """simple docstring"""



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


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






