code: import unittest
  
  from transformers import load_tool
  
  from .test_tools_common import ToolTesterMixin
  
  
  UpperCAmelCase					=				'''
  Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf originally as a company that developed a chatbot app targeted at teenagers.[2] After open-sourcing the model behind the chatbot, the company pivoted to focus on being a platform for machine learning.
  
  In March 2021, Hugging Face raised $40 million in a Series B funding round.[3]
  
  On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model.[4] In 2022, the workshop concluded with the announcement of BLOOM, a multilingual large language model with 176 billion parameters.[5]
  '''
  
  
  
  
  class    __lowerCAmelCase  (       unittest.TestCase,	a_						):
  
  
  
   '''simple docstring'''
  
   def 					__snake_case					(			self       :		int  ) ->							Optional[Any]:
          _UpperCamelCase     :       int  						=  load_tool('summarization'  )
          self.tool.setup()
          _UpperCamelCase     :       Optional[Any]  						=  load_tool('summarization'       ,			remote=lowerCamelCase  )
  
   def 					__snake_case					(			self       :		str  ) ->							int:
          _UpperCamelCase     :       Union[str, Any]  						=  self.tool(lowerCamelCase  )
          self.assertEqual(
              lowerCamelCase       ,			'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'       ,			)
  
   def 					__snake_case					(			self       :		List[Any]  ) ->							Dict:
          _UpperCamelCase     :       Optional[int]  						=  self.remote_tool(lowerCamelCase  )
          self.assertEqual(
              lowerCamelCase       ,			'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'       ,			)
  
   def 					__snake_case					(			self       :		Tuple  ) ->							List[str]:
          _UpperCamelCase     :       Union[str, Any]  						=  self.tool(text=lowerCamelCase  )
          self.assertEqual(
              lowerCamelCase       ,			'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'       ,			)
  
   def 					__snake_case					(			self       :		Optional[int]  ) ->							Optional[int]:
          _UpperCamelCase     :       Optional[Any]  						=  self.remote_tool(text=lowerCamelCase  )
          self.assertEqual(
              lowerCamelCase       ,			'Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM.'       ,			)
  
  
  
  
style_context: from __future__ import annotations
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int		,						lowercase_:	int				):
         assert (
             c % greatest_common_divisor(lowercase_		,						lowercase_				) == 0
         )  # greatest_common_divisor(a,b) function implemented below
         ((_UpperCamelCase)						,      (_UpperCamelCase)						,      (_UpperCamelCase))     :       int  						=  extended_gcd(lowercase_		,						lowercase_				)  # extended_gcd(a,b) function implemented below
         _UpperCamelCase     :       List[Any]  						=  c / d
         return (r * x, r * y)
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int		,						lowercase_:	int		,						lowercase_:	int = 2				):
         ((_UpperCamelCase)						,      (_UpperCamelCase))     :       Tuple  						=  diophantine(lowercase_		,						lowercase_		,						lowercase_				)  # Initial value
         _UpperCamelCase     :       List[Any]  						=  greatest_common_divisor(lowercase_		,						lowercase_				)
         _UpperCamelCase     :       Optional[int]  						=  a // d
         _UpperCamelCase     :       Optional[Any]  						=  b // d
  
         for i in range(lowercase_				):
                _UpperCamelCase     :       Union[str, Any]  						=  xa + i * q
                _UpperCamelCase     :       List[Any]  						=  ya - i * p
                print(lowercase_		,						lowercase_				)
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int				):
         if a < b:
                _UpperCamelCase						,      _UpperCamelCase     :       Optional[Any]  						=  b, a
  
         while a % b != 0:
                _UpperCamelCase						,      _UpperCamelCase     :       Union[str, Any]  						=  b, a % b
  
         return b
  
  
  def SCREAMING_SNAKE_CASE				(     lowercase_:	int		,						lowercase_:	int				):
         assert a >= 0 and b >= 0
  
         if b == 0:
                _UpperCamelCase						,      _UpperCamelCase						,      _UpperCamelCase     :       Optional[Any]  						=  a, 1, 0
         else:
                ((_UpperCamelCase)						,      (_UpperCamelCase)						,      (_UpperCamelCase))     :       Any  						=  extended_gcd(lowercase_		,						a % b				)
                _UpperCamelCase     :       Any  						=  q
                _UpperCamelCase     :       str  						=  p - q * (a // b)
  
         assert a % d == 0 and b % d == 0
         assert d == a * x + b * y
  
         return (d, x, y)
  
  
  if __name__ == "__main__":
   from doctest import testmod
  
   testmod(name='''diophantine''', verbose=True)
   testmod(name='''diophantine_all_soln''', verbose=True)
   testmod(name='''extended_gcd''', verbose=True)
   testmod(name='''greatest_common_divisor''', verbose=True)
  
  
  
  