




def 					UpperCAmelCase_							(      )					-> int:
      return [
          a * b * (10_00 - a - b)
          for a in range(1			,			9_99							)
          for b in range(__UpperCAmelCase			,			9_99							)
          if (a * a + b * b == (10_00 - a - b) ** 2)
      ][0]


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





class        lowerCamelCase_							:


 '''simple docstring'''







 def __init__(							self  :		List[Any]						):
       SCREAMING_SNAKE_CASE_							=			{}



 def       lowerCAmelCase_  (							self  :		List[str]						):
       print(self.vertex						)
       for i in self.vertex:
             print(_lowerCAmelCase				,				' -> '				,				' -> '.join([str(_lowerCAmelCase						) for j in self.vertex[i]]						)						)



 def       lowerCAmelCase_  (							self  :		List[Any]				,				_lowerCAmelCase  :		int				,				_lowerCAmelCase  :		int						):
       # check if vertex is already present,
       if from_vertex in self.vertex:
             self.vertex[from_vertex].append(_lowerCAmelCase						)
       else:
             # else make a new vertex
             SCREAMING_SNAKE_CASE_							=			[to_vertex]



 def       lowerCAmelCase_  (							self  :		Dict						):
       # visited array for storing already visited nodes
       SCREAMING_SNAKE_CASE_							=			[False] * len(self.vertex						)

       # call the recursive helper function
       for i in range(len(self.vertex						)						):
             if not visited[i]:
                   self.dfs_recursive(_lowerCAmelCase				,				_lowerCAmelCase						)




 def       lowerCAmelCase_  (							self  :		Union[str, Any]				,				_lowerCAmelCase  :		int				,				_lowerCAmelCase  :		list						):
       # mark start vertex as visited
       SCREAMING_SNAKE_CASE_							=			True

       print(_lowerCAmelCase				,				end=' '						)

       # Recur for all the vertices that are adjacent to this node
       for i in self.vertex:
             if not visited[i]:
                   self.dfs_recursive(_lowerCAmelCase				,				_lowerCAmelCase						)


if __name__ == "__main__":
   lowerCamelCase__ :   List[Any]					=							Graph()
   g.add_edge(0, 1)
   g.add_edge(0, 2)
   g.add_edge(1, 2)
   g.add_edge(2, 0)
   g.add_edge(2, 3)
   g.add_edge(3, 3)

   g.print_graph()
   print('DFS:')
   g.dfs()

   # OUTPUT:
   # 0  ->  1 -> 2
   # 1  ->  2
   # 2  ->  0 -> 3
   # 3  ->  3
   # DFS:
   #  0 1 2 3