from math import gcd






def    UpperCAmelCase__(						lowerCamelCase_ = 12000  ):



			"""simple docstring"""





			_snake_case              =      0
			for d in range(max_d + 1  ):
						for n in range(d // 3 + 1							,	(d + 1) // 2  ):
									if gcd(lowerCamelCase_							,	lowerCamelCase_  ) == 1:
												fractions_number += 1
			return fractions_number


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


def    UpperCAmelCase__(						lowerCamelCase_							,	lowerCamelCase_  ):



			"""simple docstring"""





			_snake_case              =      sorted(lowerCamelCase_							,	key=lambda lowerCamelCase_  : value[2]							,	reverse=lowerCamelCase_  )

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

