

def 					__lowercase      (     _A						,    _A			)     ->						int:
      while a != 0:
            SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE :      Union[str, Any]       =   b % a, a
      return b







def 					__lowercase      (     _A						,    _A			)     ->						int:
      if gcd(_A						,    _A			) != 1:
            SCREAMING_SNAKE_CASE :      List[Any]       =   F"mod inverse of {a!r} and {m!r} does not exist"
            raise ValueError(_A			)
      SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE :      List[str]       =   1, 0, a
      SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE :      Optional[Any]       =   0, 1, m
      while va != 0:
            SCREAMING_SNAKE_CASE :      Any       =   ua // va
            SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE :      Tuple       =   (ua - q * va), (ua - q * va), (ua - q * va), va, va, va
      return ua % m







def 					__lowercase      (     _A						,    _A			)     ->						int:
      assert x is not None
      assert y is not None

      SCREAMING_SNAKE_CASE :      int       =   len(_A			)
      SCREAMING_SNAKE_CASE :      Union[str, Any]       =   len(_A			)

      # declaring the array for storing the dp values
      SCREAMING_SNAKE_CASE :      Tuple       =   [[0] * (n + 1) for _ in range(m + 1			)]  # noqa: E741

      for i in range(1						,    m + 1			):
            for j in range(1						,    n + 1			):
                  SCREAMING_SNAKE_CASE :      List[Any]       =   1 if x[i - 1] == y[j - 1] else 0

                  SCREAMING_SNAKE_CASE :      int       =   max(l[i - 1][j]						,    l[i][j - 1]						,    l[i - 1][j - 1] + match			)

      SCREAMING_SNAKE_CASE :      int       =   """"""
      SCREAMING_SNAKE_CASE     ,	SCREAMING_SNAKE_CASE :      int       =   m, n
      while i > 0 and j > 0:
            SCREAMING_SNAKE_CASE :      Tuple       =   1 if x[i - 1] == y[j - 1] else 0

            if l[i][j] == l[i - 1][j - 1] + match:
                  if match == 1:
                        SCREAMING_SNAKE_CASE :      List[Any]       =   x[i - 1] + seq
                  i -= 1
                  j -= 1
            elif l[i][j] == l[i - 1][j]:
                  i -= 1
            else:
                  j -= 1

      return l[m][n], seq


if __name__ == "__main__":
  UpperCAmelCase__ :     str				    =    """AGGTAB"""
  UpperCAmelCase__ :     Optional[int]				    =    """GXTXAYB"""
  UpperCAmelCase__ :     Tuple				    =    4
  UpperCAmelCase__ :     Dict				    =    """GTAB"""

  UpperCAmelCase__    ,   UpperCAmelCase__ :     Optional[int]				    =    longest_common_subsequence(a, b)
  print("""len =""", ln, """, sub-sequence =""", subseq)
  import doctest

  doctest.testmod()




