


'''simple docstring'''
from __future__ import annotations

import time

import numpy as np

UpperCamelCase__          = [8, 5, 9, 7]
UpperCamelCase__          = [
    [2, 0, 1, 1],
    [0, 1, 2, 1],
    [4, 0, 0, 3],
    [0, 2, 1, 0],
    [1, 0, 3, 0],
]
UpperCamelCase__          = [
    [3, 2, 1, 4],
    [0, 2, 5, 2],
    [5, 1, 0, 5],
    [1, 5, 3, 0],
    [3, 0, 3, 3],
]




class      lowerCamelCase_  :






      def __init__(   self							:       Optional[Any]		,		_A							:       str		,		_A							:       Tuple		,		_A							:       int		,		):


          '''simple docstring'''


          UpperCAmelCase__     :						Any						=							claim_vector
          UpperCAmelCase__     :						List[str]						=							allocated_resources_table
          UpperCAmelCase__     :						Dict						=							maximum_claim_table






      def lowercase_				(   self							:       str					):


          '''simple docstring'''


          return [
              sum(p_item[i] for p_item in self.__allocated_resources_table					)
              for i in range(len(self.__allocated_resources_table[0]					)					)
          ]






      def lowercase_				(   self							:       str					):


          '''simple docstring'''


          return np.array(self.__claim_vector					) - np.array(
              self.__processes_resource_summation()					)






      def lowercase_				(   self							:       List[Any]					):


          '''simple docstring'''


          return [
              list(np.array(self.__maximum_claim_table[i]					) - np.array(__snake_case					)					)
              for i, allocated_resource in enumerate(self.__allocated_resources_table					)
          ]






      def lowercase_				(   self							:       Any					):


          '''simple docstring'''


          return {self.__need().index(__snake_case					): i for i in self.__need()}






      def lowercase_				(   self							:       Tuple		,		**_A							:       Optional[Any]					):


          '''simple docstring'''


          UpperCAmelCase__     :						Tuple						=							self.__need()
          UpperCAmelCase__     :						Optional[Any]						=							self.__allocated_resources_table
          UpperCAmelCase__     :						Dict						=							self.__available_resources()
          UpperCAmelCase__     :						Tuple						=							self.__need_index_manager()
          for kw, val in kwargs.items():
              if kw and val is True:
                  self.__pretty_data()
          print('''_''' * 50 + '''\n'''					)
          while need_list:
              UpperCAmelCase__     :						List[Any]						=							False
              for each_need in need_list:
                  UpperCAmelCase__     :						Dict						=							True
                  for index, need in enumerate(__snake_case					):
                      if need > available_resources[index]:
                          UpperCAmelCase__     :						List[Any]						=							False
                          break
                  if execution:
                      UpperCAmelCase__     :						int						=							True
                      # get the original index of the process from ind_ctrl db
                      for original_need_index, need_clone in need_index_manager.items():
                          if each_need == need_clone:
                              UpperCAmelCase__     :						Optional[Any]						=							original_need_index
                      print(f"""Process {process_number + 1} is executing."""					)
                      # remove the process run from stack
                      need_list.remove(__snake_case					)
                      # update available/freed resources stack
                      UpperCAmelCase__     :						List[str]						=							np.array(__snake_case					) + np.array(
                          alloc_resources_table[process_number]					)
                      print(
                          '''Updated available resource stack for processes: '''
                          + ''' '''.join([str(__snake_case					) for x in available_resources]					)					)
                      break
              if safe:
                  print('''The process is in a safe state.\n'''					)
              else:
                  print('''System in unsafe state. Aborting...\n'''					)
                  break






      def lowercase_				(   self							:       List[Any]					):


          '''simple docstring'''


          print(''' ''' * 9 + '''Allocated Resource Table'''					)
          for item in self.__allocated_resources_table:
              print(
                  f"""P{self.__allocated_resources_table.index(__snake_case					) + 1}"""
                  + ''' '''.join(f"""{it:>8}""" for it in item					)
                  + '''\n'''					)
          print(''' ''' * 9 + '''System Resource Table'''					)
          for item in self.__maximum_claim_table:
              print(
                  f"""P{self.__maximum_claim_table.index(__snake_case					) + 1}"""
                  + ''' '''.join(f"""{it:>8}""" for it in item					)
                  + '''\n'''					)
          print(
              '''Current Usage by Active Processes: '''
              + ''' '''.join(str(__snake_case					) for x in self.__claim_vector					)					)
          print(
              '''Initial Available Resources:       '''
              + ''' '''.join(str(__snake_case					) for x in self.__available_resources()					)					)
          time.sleep(1					)


if __name__ == "__main__":
  import doctest

  doctest.testmod()







def      UpperCAmelCase_    (    _UpperCAmelCase							:list				)	->				list:
     '''simple docstring'''


     if len(_UpperCAmelCase				) < 2:
          return collection

     def circle_sort_util(_UpperCAmelCase							:list  ,						_UpperCAmelCase							:int  ,						_UpperCAmelCase							:int				) -> bool:
          A_          =       False

          if low == high:
               return swapped

          A_          =       low
          A_          =       high

          while left < right:
               if collection[left] > collection[right]:
                    A_   ,    A_          =       (
                        collection[right],
                        collection[left],
                    )
                    A_          =       True

               left += 1
               right -= 1

          if left == right and collection[left] > collection[right + 1]:
               A_   ,    A_          =       (
                   collection[right + 1],
                   collection[left],
               )

               A_          =       True

          A_          =       low + int((high - low) / 2				)
          A_          =       circle_sort_util(_UpperCAmelCase  ,						_UpperCAmelCase  ,						_UpperCAmelCase				)
          A_          =       circle_sort_util(_UpperCAmelCase  ,						mid + 1  ,						_UpperCAmelCase				)

          return swapped or left_swap or right_swap

     A_          =       True

     while is_not_sorted is True:
          A_          =       circle_sort_util(_UpperCAmelCase  ,						0  ,						len(_UpperCAmelCase				) - 1				)

     return collection


if __name__ == "__main__":
      a__      :     Optional[Any]         =		input('Enter numbers separated by a comma:\n').strip()
      a__      :     List[str]         =		[int(item) for item in user_input.split(',')]
      print(circle_sort(unsorted))



