




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						List[str]	,					__UpperCamelCase      :						List[str]				)  ->							Optional[Any]:
    UpperCAmelCase_										=					[1]
    for i in range(2	,					__UpperCamelCase				):
        factorials.append(factorials[-1] * i				)
    assert 0 <= k < factorials[-1] * n, "k out of bounds"

    UpperCAmelCase_										=					[]
    UpperCAmelCase_										=					list(range(__UpperCamelCase				)				)

    # Find permutation
    while factorials:
        UpperCAmelCase_										=					factorials.pop()
        UpperCAmelCase_			,							UpperCAmelCase_										=					divmod(__UpperCamelCase	,					__UpperCamelCase				)
        permutation.append(elements[number]				)
        elements.remove(elements[number]				)
    permutation.append(elements[0]				)

    return permutation


if __name__ == "__main__":
  import doctest

  doctest.testmod()











from __future__ import annotations

from fractions import Fraction




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int	,					__UpperCamelCase      :						int				)  ->							bool:
    return (
        num != den and num % 10 == den // 10 and (num // 10) / (den % 10) == num / den
    )




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int				)  ->							list[str]:
    UpperCAmelCase_										=					[]
    UpperCAmelCase_										=					11
    UpperCAmelCase_										=					int('''1''' + '''0''' * digit_len				)
    for num in range(__UpperCamelCase	,					__UpperCamelCase				):
        while den <= 99:
            if (num != den) and (num % 10 == den // 10) and (den % 10 != 0):
                if is_digit_cancelling(__UpperCamelCase	,					__UpperCamelCase				):
                    solutions.append(f'{num}/{den}'				)
            den += 1
        num += 1
        UpperCAmelCase_										=					10
    return solutions




def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int = 2				)  ->							int:
    UpperCAmelCase_										=					1.0
    for fraction in fraction_list(__UpperCamelCase				):
        UpperCAmelCase_										=					Fraction(__UpperCamelCase				)
        result *= frac.denominator / frac.numerator
    return int(__UpperCamelCase				)


if __name__ == "__main__":
 print(solution())





