




'''simple docstring'''

def    snake_case__     (  a       ,      a	)			->       int:





			'''simple docstring'''






			snake_case__          =						sorted(A__       ,      key=lambda a	: value[2]       ,      reverse=A__	)

			# Create a list of size equal to the maximum deadline
			# and initialize it with -1
			snake_case__          =						max(A__       ,      key=lambda a	: value[1]	)[1]
			snake_case__          =						[-1] * max_deadline

			# Finding the maximum profit and the count of jobs
			snake_case__          =						0
			snake_case__          =						0
			for job in jobs:
						# Find a free time slot for this job
						# (Note that we start from the last possible slot)
						for i in range(job[1] - 1       ,      -1       ,      -1	):
									if time_slots[i] == -1:
												snake_case__          =						job[0]
												count += 1
												max_profit += job[2]
												break
			return [count, max_profit]


if __name__ == "__main__":
		import doctest

		doctest.testmod()



def 	A (		A__			):
     UpperCAmelCase    :					Dict			=      9

     while num > 0:
          if num % 1_0 != digit:
               return False
          num //= 1_0_0
          digit -= 1

     return True







def 	A (		):
     UpperCAmelCase    :					Optional[Any]			=      1_3_8_9_0_2_6_6_3

     while not is_square_form(num * num			):
          if num % 1_0 == 3:
               num -= 6  # (3 - 6) % 10 = 7
          else:
               num -= 4  # (7 - 4) % 10 = 3

     return num * 1_0


if __name__ == "__main__":
      print(f'''{solution() = }''')



