


from __future__ import annotations

import time

import numpy as np

snake_case_						:			List[str]													=							[8, 5, 9, 7]
snake_case_						:			Optional[int]													=							[
    [2, 0, 1, 1],
    [0, 1, 2, 1],
    [4, 0, 0, 3],
    [0, 2, 1, 0],
    [1, 0, 3, 0],
]
snake_case_						:			str													=							[
    [3, 2, 1, 4],
    [0, 2, 5, 2],
    [5, 1, 0, 5],
    [1, 5, 3, 0],
    [3, 0, 3, 3],
]

class 						A__							:




						def __init__(       self					:      Tuple				,    _a					:      list[int]				,    _a					:      list[list[int]]				,    _a					:      list[list[int]]				,    )							->     None:


										"""simple docstring"""





										_SCREAMING_SNAKE_CASE			  =claim_vector
										_SCREAMING_SNAKE_CASE			  =allocated_resources_table
										_SCREAMING_SNAKE_CASE			  =maximum_claim_table




						def 							__UpperCamelCase				(       self					:      Optional[int]  )							->     list[int]:


										"""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 							__UpperCamelCase				(       self					:      Union[str, Any]  )							->     list[int]:


										"""simple docstring"""





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




						def 							__UpperCamelCase				(       self					:      str  )							->     list[list[int]]:


										"""simple docstring"""





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




						def 							__UpperCamelCase				(       self					:      Optional[Any]  )							->     dict[int, list[int]]:


										"""simple docstring"""





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




						def 							__UpperCamelCase				(       self					:      Optional[int]				,    **_a					:      List[Any]  )							->     None:


										"""simple docstring"""





										_SCREAMING_SNAKE_CASE			  =self.__need()
										_SCREAMING_SNAKE_CASE			  =self.__allocated_resources_table
										_SCREAMING_SNAKE_CASE			  =self.__available_resources()
										_SCREAMING_SNAKE_CASE			  =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:
														_SCREAMING_SNAKE_CASE			  =False
														for each_need in need_list:
																		_SCREAMING_SNAKE_CASE			  =True
																		for index, need in enumerate(_a  ):
																						if need > available_resources[index]:
																										_SCREAMING_SNAKE_CASE			  =False
																										break
																		if execution:
																						_SCREAMING_SNAKE_CASE			  =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:
																														_SCREAMING_SNAKE_CASE			  =original_need_index
																						print(f"Process {process_number + 1} is executing."  )
																						# remove the process run from stack
																						need_list.remove(_a  )
																						# update available/freed resources stack
																						_SCREAMING_SNAKE_CASE			  =np.array(_a  ) + np.array(
																						    alloc_resources_table[process_number]  )
																						print(
																						    '''Updated available resource stack for processes: '''
																						    + ''' '''.join([str(_a  ) 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 							__UpperCamelCase				(       self					:      Tuple  )							->     Union[str, Any]:


										"""simple docstring"""





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


if __name__ == "__main__":
							import doctest

							doctest.testmod()



snake_case_						:			dict[tuple[int, int, int], int]													=							{}







def 						lowerCamelCase(   a__	,a__	,a__):

				# if we are absent twice, or late 3 consecutive days,
				# no further prize strings are possible
				if late == 3 or absent == 2:
								return 0

				# if we have no days left, and have not failed any other rules,
				# we have a prize string
				if days == 0:
								return 1

				# No easy solution, so now we need to do the recursive calculation

				# First, check if the combination is already in the cache, and
				# if yes, return the stored value from there since we already
				# know the number of possible prize strings from this point on
				_SCREAMING_SNAKE_CASE			  =(days, absent, late)
				if key in cache:
								return cache[key]

				# now we calculate the three possible ways that can unfold from
				# this point on, depending on our attendance today

				# 1) if we are late (but not absent), the "absent" counter stays as
				# it is, but the "late" counter increases by one
				_SCREAMING_SNAKE_CASE			  =_calculate(days - 1	,a__	,late + 1)

				# 2) if we are absent, the "absent" counter increases by 1, and the
				# "late" counter resets to 0
				_SCREAMING_SNAKE_CASE			  =_calculate(days - 1	,absent + 1	,0)

				# 3) if we are on time, this resets the "late" counter and keeps the
				# absent counter
				_SCREAMING_SNAKE_CASE			  =_calculate(days - 1	,a__	,0)

				_SCREAMING_SNAKE_CASE			  =state_late + state_absent + state_ontime

				_SCREAMING_SNAKE_CASE			  =prizestrings
				return prizestrings







def 						lowerCamelCase(   a__ = 30):
				return _calculate(a__	,absent=0	,late=0)


if __name__ == "__main__":
							print(solution())