



def 					__snake_case     (      _UpperCAmelCase       ,			_UpperCAmelCase    ):
    __a							=    [1]
    for i in range(2       ,			_UpperCAmelCase    ):
        factorials.append(factorials[-1] * i    )
    assert 0 <= k < factorials[-1] * n, "k out of bounds"

    __a							=    []
    __a							=    list(range(_UpperCAmelCase    )    )

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

    return permutation


if __name__ == "__main__":
 import doctest

 doctest.testmod()










def 					__snake_case     (      _UpperCAmelCase = 1000000    ):
    __a							=    limit + 1
    __a							=    [0] * limit
    for first_term in range(1       ,			_UpperCAmelCase    ):
        for n in range(_UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase    ):
            __a							=    first_term + n / first_term
            if common_difference % 4:  # d must be divisble by 4
                continue
            else:
                common_difference /= 4
                if (
                    first_term > common_difference
                    and first_term < 4 * common_difference
                ):  # since x,y,z are positive integers
                    frequency[n] += 1  # so z>0 and a>d ,also 4d<a

    __a							=    sum(1 for x in frequency[1:limit] if x == 10    )

    return count


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





