



def    UpperCAmelCase					(  lowercase__						:					int				,					lowercase__						:					list	):



			'''simple docstring'''





			a__					=  sorted(lowercase__				,					key=lambda lowercase__	: value[2]				,					reverse=lowercase__	)

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

			# Finding the maximum profit and the count of jobs
			a__					=  0
			a__					=  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:
												a__					=  job[0]
												count += 1
												max_profit += job[2]
												break
			return [count, max_profit]


if __name__ == "__main__":
	import doctest

	doctest.testmod()






'''simple docstring'''



def 	__lowerCAmelCase       (				lowerCamelCase :    list[list[int]]					,		lowerCamelCase :    list[list[int]]       ):






	'''simple docstring'''




	__lowerCAmelCase       				=	[]
	__lowerCAmelCase       				=	len(lowerCamelCase       )
	for i in range(lowerCamelCase       ):
		__lowerCAmelCase       				=	[]
		for j in range(lowerCamelCase       ):
			__lowerCAmelCase       				=	0
			for k in range(lowerCamelCase       ):
				__lowerCAmelCase       				=	val + matrix_a[i][k] * matrix_b[k][j]
			list_a.append(lowerCamelCase       )
		matrix_c.append(lowerCamelCase       )
	return matrix_c



def 	__lowerCAmelCase       (				lowerCamelCase :    int       ):






	'''simple docstring'''




	return [[int(row == column       ) for column in range(lowerCamelCase       )] for row in range(lowerCamelCase       )]



def 	__lowerCAmelCase       (				lowerCamelCase :    int       ):






	'''simple docstring'''




	if n <= 1:
		return n
	__lowerCAmelCase       				=	identity(2       )
	__lowerCAmelCase       				=	[[1, 1], [1, 0]]
	__lowerCAmelCase       				=	n - 1
	while n > 0:
		if n % 2 == 1:
			__lowerCAmelCase       				=	multiply(lowerCamelCase					,		lowerCamelCase       )
		__lowerCAmelCase       				=	multiply(lowerCamelCase					,		lowerCamelCase       )
		__lowerCAmelCase       				=	int(n / 2       )
	return res_matrix[0][0]



def 	__lowerCAmelCase       (				lowerCamelCase :    int       ):






	'''simple docstring'''




	if n <= 1:
		return n
	__lowerCAmelCase       				=	0
	__lowerCAmelCase       				=	1
	for _ in range(2					,		n + 1       ):
		__lowerCAmelCase				,							__lowerCAmelCase       				=	fiba, fiba + fiba
	return fiba



def 	__lowerCAmelCase       (				):






	'''simple docstring'''




	for ordinal in "0th 1st 2nd 3rd 10th 100th 1000th".split():
		__lowerCAmelCase       				=	int("".join(c for c in ordinal if c in "0123456789"       )       )  # 1000th --> 1000
		print(
		    f'''{ordinal} fibonacci number using matrix exponentiation is '''
		    f'''{nth_fibonacci_matrix(lowerCamelCase       )} and using bruteforce is '''
		    f'''{nth_fibonacci_bruteforce(lowerCamelCase       )}\n'''       )
	# from timeit import timeit
	# print(timeit("nth_fibonacci_matrix(1000000)",
	#              "from main import nth_fibonacci_matrix", number=5))
	# print(timeit("nth_fibonacci_bruteforce(1000000)",
	#              "from main import nth_fibonacci_bruteforce", number=5))
	# 2.3342058970001744
	# 57.256506615000035


if __name__ == "__main__":
	import doctest

	doctest.testmod()
	main()