


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

    _lowercase       :							int      		=		[]
    _lowercase       :							Union[str, Any]      		=		list(range(lowerCamelCase_ ) )

    # Find permutation
    while factorials:
        _lowercase       :							Dict      		=		factorials.pop()
        _lowercase		,				_lowercase       :							Any      		=		divmod(lowerCamelCase_							, lowerCamelCase_ )
        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



def 				UpperCamelCase_(      lowerCamelCase_ )    ->						bool:
    if len(lowerCamelCase_ ) < 2:
        raise ValueError('Monogons and Digons are not polygons in the Euclidean space' )
    if any(i <= 0 for i in nums ):
        raise ValueError('All values must be greater than 0' )
    _lowercase       :							Tuple      		=		nums.copy()
    copy_nums.sort()
    return copy_nums[-1] < sum(copy_nums[:-1] )


if __name__ == "__main__":
 import doctest

 doctest.testmod()


