



lowerCamelCase__			= {"""a""": ["""c""", """b"""], """b""": ["""d""", """e"""], """c""": [], """d""": [], """e""": []}
lowerCamelCase__			= ["""a""", """b""", """c""", """d""", """e"""]

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			Union[str, Any]				,     _SCREAMING_SNAKE_CASE       :			int				,     _SCREAMING_SNAKE_CASE       :			Dict    ):
				"""simple docstring"""







				__a       =		start
				# add current to visited
				visited.append(_SCREAMING_SNAKE_CASE    )
				__a       =		edges[current]
				for neighbor in neighbors:
								# if neighbor not in visited, visit
								if neighbor not in visited:
												__a       =		topological_sort(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    )
    # if all neighbors visited add current to sort
				sort.append(_SCREAMING_SNAKE_CASE    )
				# if all vertices haven't been visited select a new one to visit
				if len(_SCREAMING_SNAKE_CASE    ) != len(_SCREAMING_SNAKE_CASE    ):
								for vertice in vertices:
												if vertice not in visited:
																__a       =		topological_sort(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    )
    # return sort
				return sort


if __name__ == "__main__":
						lowerCamelCase__			= topological_sort("""a""", [], [])
						print(sort)





def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int = 3				,     _SCREAMING_SNAKE_CASE       :			int = 7				,     _SCREAMING_SNAKE_CASE       :			int = 100_0000    ):
				"""simple docstring"""







				__a       =		0
				__a       =		1

				for current_denominator in range(1				,     limit + 1    ):
								__a       =		current_denominator * numerator // denominator
								if current_denominator % denominator == 0:
												current_numerator -= 1
								if current_numerator * max_denominator > current_denominator * max_numerator:
												__a       =		current_numerator
												__a       =		current_denominator
				return max_numerator


if __name__ == "__main__":
						print(solution(numerator=3, denominator=7, limit=100_0000))
