




'''simple docstring'''





from __future__ import annotations

import sys





def UpperCAmelCase    (       UpperCAmelCase_   ,	UpperCAmelCase_						):
    # base cases
    if abs(UpperCAmelCase_						) == 1:
        return a, 0
    elif abs(UpperCAmelCase_						) == 1:
        return 0, b

    _a       , _a				:							List[Any]							       =      a, b
    _a       , _a				:							str							       =      1, 0
    _a       , _a				:							Union[str, Any]							       =      0, 1

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

    # sign correction for negative numbers
    if a < 0:
        _a				:							Tuple							       =      -old_coeff_a
    if b < 0:
        _a				:							Any							       =      -old_coeff_b

    return old_coeff_a, old_coeff_b





def UpperCAmelCase    (       ):
    if len(sys.argv						) < 3:
        print("""2 integer arguments required"""						)
        return 1
    _a				:							Union[str, Any]							       =      int(sys.argv[1]						)
    _a				:							Any							       =      int(sys.argv[2]						)
    print(extended_euclidean_algorithm(UpperCAmelCase_   ,	UpperCAmelCase_						)						)
    return 0


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









import itertools
from pathlib import Path

def      a    (   _lowercase :  list[str]							)  ->int:
		UpperCamelCase__								=						[tuple(_lowercase							) for login in logins]

		UpperCamelCase__								=						{char for login in split_logins for char in login}

		for permutation in itertools.permutations(_lowercase							):
				UpperCamelCase__								=						True
				for login in logins:
						if not (
						    permutation.index(login[0]							)
						    < permutation.index(login[1]							)
						    < permutation.index(login[2]							)
						):
								UpperCamelCase__								=						False
								break

				if satisfied:
						return int("""""".join(_lowercase							)							)

		raise Exception("""Unable to find the secret passcode"""							)

def      a    (   _lowercase :  str = "keylog.txt"							)  ->int:
		UpperCamelCase__								=						Path(_lowercase							).parent.joinpath(_lowercase							).read_text().splitlines()

		return find_secret_passcode(_lowercase							)


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





