



"""simple docstring"""







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


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

'''simple docstring'''






def  _SCREAMING_SNAKE_CASE		(      __snake_case							:			str   ,		__snake_case							:			str   ,		__snake_case							:			List[Any]=False				):

     if isinstance(__snake_case   ,		__snake_case				) and isinstance(__snake_case   ,		__snake_case				):
          _A    		=  len(set_a.intersection(__snake_case				)				)

          if alternative_union:
               _A    		=  len(__snake_case				) + len(__snake_case				)
          else:
               _A    		=  len(set_a.union(__snake_case				)				)

          return intersection / union

     if isinstance(__snake_case   ,		(list, tuple)				) and isinstance(__snake_case   ,		(list, tuple)				):
          _A    		=  [element for element in set_a if element in set_b]

          if alternative_union:
               _A    		=  len(__snake_case				) + len(__snake_case				)
               return len(__snake_case				) / union
          else:
               _A    		=  set_a + [element for element in set_b if element not in set_a]
               return len(__snake_case				) / len(__snake_case				)

          return len(__snake_case				) / len(__snake_case				)
     return None


if __name__ == "__main__":
   _UpperCAmelCase    :     Optional[Any]         =       {'''a''', '''b''', '''c''', '''d''', '''e'''}
   _UpperCAmelCase    :     str         =       {'''c''', '''d''', '''e''', '''f''', '''h''', '''i'''}
   print(jaccard_similarity(set_a, set_b))



