





'''simple docstring'''






from __future__ import annotations

import sys


def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     int  ,  SCREAMING_SNAKE_CASE_					:     int   )							->       tuple[int, int]:
      """simple docstring"""

      if abs(SCREAMING_SNAKE_CASE_   ) == 1:
            return a, 0
      elif abs(SCREAMING_SNAKE_CASE_   ) == 1:
            return 0, b

      SCREAMING_SNAKE_CASE_				:      Union[str, Any]					=	a, b
      SCREAMING_SNAKE_CASE_				:      Union[str, Any]					=	1, 0
      SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	0, 1

      while remainder != 0:
            SCREAMING_SNAKE_CASE_				:      List[str]					=	old_remainder // remainder
            SCREAMING_SNAKE_CASE_				:      int					=	remainder, old_remainder - quotient * remainder
            SCREAMING_SNAKE_CASE_				:      int					=	coeff_a, old_coeff_a - quotient * coeff_a
            SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	coeff_b, old_coeff_b - quotient * coeff_b

      # sign correction for negative numbers
      if a < 0:
            SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	-old_coeff_a
      if b < 0:
            SCREAMING_SNAKE_CASE_				:      Tuple					=	-old_coeff_b

      return old_coeff_a, old_coeff_b


def  __lowerCamelCase      (				)							->       str:
      """simple docstring"""

      if len(sys.argv   ) < 3:
            print("2 integer arguments required"   )
            return 1
      SCREAMING_SNAKE_CASE_				:      List[str]					=	int(sys.argv[1]   )
      SCREAMING_SNAKE_CASE_				:      List[Any]					=	int(sys.argv[2]   )
      print(extended_euclidean_algorithm(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_   )   )
      return 0


if __name__ == "__main__":
      raise SystemExit(main())




'''simple docstring'''






def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     Optional[int]  ,  SCREAMING_SNAKE_CASE_					:     Tuple   )							->       List[str]:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[str]					=	(boundary[1] - boundary[0]) / steps
      SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	boundary[0]
      SCREAMING_SNAKE_CASE_				:      int					=	boundary[1]
      SCREAMING_SNAKE_CASE_				:      List[Any]					=	make_points(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_   )
      SCREAMING_SNAKE_CASE_				:      Dict					=	0.0
      y += (h / 3.0) * f(SCREAMING_SNAKE_CASE_   )
      SCREAMING_SNAKE_CASE_				:      Tuple					=	2
      for i in x_i:
            y += (h / 3) * (4 - 2 * (cnt % 2)) * f(SCREAMING_SNAKE_CASE_   )
            cnt += 1
      y += (h / 3.0) * f(SCREAMING_SNAKE_CASE_   )
      return y


def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     Optional[Any]  ,  SCREAMING_SNAKE_CASE_					:     List[Any]  ,  SCREAMING_SNAKE_CASE_					:     Optional[Any]   )							->       List[Any]:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[Any]					=	a + h
      while x < (b - h):
            yield x
            SCREAMING_SNAKE_CASE_				:      List[Any]					=	x + h


def  __lowerCamelCase      (				SCREAMING_SNAKE_CASE_					:     str   )							->       List[Any]:  # enter your function here
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[str]					=	(x - 0) * (x - 0)
      return y


def  __lowerCamelCase      (				)							->       int:
      """simple docstring"""

      SCREAMING_SNAKE_CASE_				:      List[Any]					=	0.0  # Lower bound of integration
      SCREAMING_SNAKE_CASE_				:      Optional[Any]					=	1.0  # Upper bound of integration
      SCREAMING_SNAKE_CASE_				:      str					=	10.0  # define number of steps or resolution
      SCREAMING_SNAKE_CASE_				:      List[Any]					=	[a, b]  # define boundary of integration
      SCREAMING_SNAKE_CASE_				:      List[str]					=	method_a(SCREAMING_SNAKE_CASE_  ,  SCREAMING_SNAKE_CASE_   )
      print(F"y = {y}"   )


if __name__ == "__main__":
      main()

