





'''simple docstring'''







def        lowerCamelCase_      (  SCREAMING_SNAKE_CASE__      :			dict   ) ->	set:
						UpperCAmelCase_			:      Union[str, Any]     						=  set()
						# edges = list of graph's edges
						UpperCAmelCase_			:      Optional[int]     						=  get_edges(SCREAMING_SNAKE_CASE__   )

						# While there are still elements in edges list, take an arbitrary edge
						# (from_node, to_node) and add his extremity to chosen_vertices and then
						# remove all arcs adjacent to the from_node and to_node
						while edges:
												UpperCAmelCase_			:      Optional[int]     						=  edges.pop()
												chosen_vertices.add(SCREAMING_SNAKE_CASE__   )
												chosen_vertices.add(SCREAMING_SNAKE_CASE__   )
												for edge in edges.copy():
																		if from_node in edge or to_node in edge:
																								edges.discard(SCREAMING_SNAKE_CASE__   )
						return chosen_vertices





def        lowerCamelCase_      (  SCREAMING_SNAKE_CASE__      :			dict   ) ->	set:
						UpperCAmelCase_			:      int     						=  set()
						for from_node, to_nodes in graph.items():
												for to_node in to_nodes:
																		edges.add((from_node, to_node)   )
						return edges


if __name__ == "__main__":
					import doctest

					doctest.testmod()

					# graph = {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}
					# print(f"Matching vertex cover:\n{matching_min_vertex_cover(graph)}")












'''simple docstring'''







def        lowerCamelCase_      (  SCREAMING_SNAKE_CASE__      :			int = 10,			SCREAMING_SNAKE_CASE__      :			int = 22   ) ->	int:
						UpperCAmelCase_			:      Optional[int]     						=  range(1,			SCREAMING_SNAKE_CASE__   )
						UpperCAmelCase_			:      List[Any]     						=  range(1,			SCREAMING_SNAKE_CASE__   )
						return sum(
						    1 for power in powers for base in bases if len(str(base**power   )   ) == power   )


if __name__ == "__main__":
					print(f'''{solution(10, 22) = }''')





