
import torch

from transformers import PreTrainedModel

from .custom_configuration import CustomConfig, NoSuperInitConfig






class 							SCREAMING_SNAKE_CASE__     (				SCREAMING_SNAKE_CASE_     ):

							"""simple docstring"""






							_snake_case  		=	CustomConfig



							def __init__(	self  ,						SCREAMING_SNAKE_CASE_      )-> Dict:





													'''simple docstring'''






													super().__init__(SCREAMING_SNAKE_CASE_      )
													__UpperCamelCase  	=      torch.nn.Linear(config.hidden_size  ,						config.hidden_size      )



							def      A__		(	self  ,						SCREAMING_SNAKE_CASE_      )-> Tuple:





													'''simple docstring'''






													return self.linear(SCREAMING_SNAKE_CASE_      )



							def      A__		(	self  ,						SCREAMING_SNAKE_CASE_      )-> Any:





													'''simple docstring'''






													pass






class 							SCREAMING_SNAKE_CASE__     (				SCREAMING_SNAKE_CASE_     ):

							"""simple docstring"""






							_snake_case  		=	NoSuperInitConfig



							def __init__(	self  ,						SCREAMING_SNAKE_CASE_      )-> Optional[Any]:





													'''simple docstring'''






													super().__init__(SCREAMING_SNAKE_CASE_      )
													__UpperCamelCase  	=      torch.nn.Linear(config.attribute  ,						config.attribute      )



							def      A__		(	self  ,						SCREAMING_SNAKE_CASE_      )-> Optional[Any]:





													'''simple docstring'''






													return self.linear(SCREAMING_SNAKE_CASE_      )



							def      A__		(	self  ,						SCREAMING_SNAKE_CASE_      )-> Optional[int]:





													'''simple docstring'''






													pass





'''simple docstring'''


from itertools import combinations, product


def    _lowerCamelCase       ( lowerCamelCase_   :				int      ,	lowerCamelCase_   :				int      ,	lowerCamelCase_   :				int      ,	lowerCamelCase_   :				int  ):



     """simple docstring"""





     if xa == ya == 0 or xa == ya == 0:
          return False
     UpperCAmelCase_				:  Union[str, Any]  = xa * xa + ya * ya
     UpperCAmelCase_				:  str  = xa * xa + ya * ya
     UpperCAmelCase_				:  str  = (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       ( lowerCamelCase_   :				int = 50  ):



     """simple docstring"""





     return sum(
         1
         for pta, pta in combinations(product(range(limit + 1  )      ,	repeat=2  )      ,	2  )
         if is_right(*lowerCamelCase_      ,	*lowerCamelCase_  )  )


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






