"""simple docstring"""
from ..utils import DummyObject, requires_backends




class   __snake_case			(	metaclass=__lowerCAmelCase							):
      a__								=						["""torch""", """transformers""", """k_diffusion"""]



      def __init__(		self       ,     *lowercase       ,     **lowercase)      ->     Any:





        '''simple docstring'''





        requires_backends(self       ,     ['torch', 'transformers', 'k_diffusion'])



      @classmethod
      def     lowerCamelCase_  (		cls       ,     *lowercase       ,     **lowercase)      ->     Union[str, Any]:





        '''simple docstring'''





        requires_backends(cls       ,     ['torch', 'transformers', 'k_diffusion'])



      @classmethod
      def     lowerCamelCase_  (		cls       ,     *lowercase       ,     **lowercase)      ->     Any:





        '''simple docstring'''





        requires_backends(cls       ,     ['torch', 'transformers', 'k_diffusion'])










"""simple docstring"""



from itertools import combinations, product




def   _lowerCAmelCase		(				UpperCAmelCase__							:       int,    UpperCAmelCase__							:       int,    UpperCAmelCase__							:       int,    UpperCAmelCase__							:       int   )		->bool:
						if xa == ya == 0 or xa == ya == 0:
												return False
						A__    :	List[str]			=	xa * xa + ya * ya
						A__    :	List[Any]			=	xa * xa + ya * ya
						A__    :	Optional[int]			=	(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
						return (
						    a_square + b_square == c_square
						    or a_square + c_square == b_square
						    or b_square + c_square == a_square
						)




def   _lowerCAmelCase		(				UpperCAmelCase__							:       int = 5_0   )		->int:
						return sum(
						    1
						    for pta, pta in combinations(product(range(limit + 1   ),    repeat=2   ),    2   )
						    if is_right(*UpperCAmelCase__,    *UpperCAmelCase__   )   )


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






