




'''simple docstring'''

def    snake_case__     (  a       ,      a	)			->       list:





			'''simple docstring'''






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

			# Create a list of size equal to the maximum deadline
			# and initialize it with -1
			snake_case__          =						max(__lowercase       ,      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()



"""simple docstring"""


from math import factorial






def   a__			(					__lowercase  ,      __lowercase )						->						List[Any]:
				return factorial(__lowercase ) / (factorial(__lowercase ) * factorial(n - r ))






def   a__			(					)						->						List[str]:
				_A       	=      0

				for i in range(1  ,      101 ):
								for j in range(1  ,      i + 1 ):
												if combinations(__lowercase  ,      __lowercase ) > 1E6:
																total += 1
				return total


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