
'''simple docstring'''






from __future__ import annotations





def    UpperCAmelCase							(  UpperCAmelCase__							:							int):
				lowerCamelCase					:			List[Any]									= str(UpperCAmelCase__)
				return len(UpperCAmelCase__) == 9 and set(UpperCAmelCase__) == set('123456789')





def    UpperCAmelCase							(  ):
				for base_num in range(99_99       ,							49_99       ,							-1):
								lowerCamelCase					:			Tuple									= 10_00_02 * base_num
								if is_9_pandigital(UpperCAmelCase__):
												return candidate

				for base_num in range(3_33       ,							99       ,							-1):
								lowerCamelCase					:			List[Any]									= 1_00_20_03 * base_num
								if is_9_pandigital(UpperCAmelCase__):
												return candidate

				return None


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


'''simple docstring'''






A			      =      {'a': ['c', 'b'], 'b': ['d', 'e'], 'c': [], 'd': [], 'e': []}
A			      =      ['a', 'b', 'c', 'd', 'e']





def    UpperCAmelCase							(  UpperCAmelCase__							:							Union[str, Any]       ,							UpperCAmelCase__							:							Any       ,							UpperCAmelCase__							:							List[Any]):
				lowerCamelCase					:			List[Any]									= start
				# add current to visited
				visited.append(UpperCAmelCase__)
				lowerCamelCase					:			List[str]									= edges[current]
				for neighbor in neighbors:
								# if neighbor not in visited, visit
								if neighbor not in visited:
												lowerCamelCase					:			Any									= topological_sort(UpperCAmelCase__       ,							UpperCAmelCase__       ,							UpperCAmelCase__)
    # if all neighbors visited add current to sort
				sort.append(UpperCAmelCase__)
				# if all vertices haven't been visited select a new one to visit
				if len(UpperCAmelCase__) != len(UpperCAmelCase__):
								for vertice in vertices:
												if vertice not in visited:
																lowerCamelCase					:			List[str]									= topological_sort(UpperCAmelCase__       ,							UpperCAmelCase__       ,							UpperCAmelCase__)
    # return sort
				return sort


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