






def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			List[Any]			,				__lowercase   :			Dict			,				__lowercase   :			str    )						->      Dict:





    """simple docstring"""

    if n == 0:
        return 1

    elif n % 2 == 1:
        return (binary_exponentiation(__lowercase			,				n - 1			,				__lowercase    ) * a) % mod

    else:
        __A         =	binary_exponentiation(__lowercase			,				n / 2			,				__lowercase    )
        return (b * b) % mod


# a prime number
__a      :       Union[str, Any]				  =   701

__a      :       Dict				  =   1000000000
__a      :       Union[str, Any]				  =   10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)






print((a / b) % p == (a * b ** (p - 2)) % p)












from __future__ import annotations



def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			list[int]			,				__lowercase   :			int    )						->      list[list[int]]:





    """simple docstring"""

    __A         =	[]
    __A         =	[]
    __A         =	0
    __A         =	sum(__lowercase    )
    create_state_space_tree(__lowercase			,				__lowercase			,				__lowercase			,				__lowercase			,				__lowercase			,				__lowercase    )
    return result



def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			list[int]			,				__lowercase   :			int			,				__lowercase   :			int			,				__lowercase   :			list[int]			,				__lowercase   :			list[list[int]]			,				__lowercase   :			int			,				)						->      None:





    """simple docstring"""

    if sum(__lowercase    ) > max_sum or (remaining_nums_sum + sum(__lowercase    )) < max_sum:
        return
    if sum(__lowercase    ) == max_sum:
        result.append(__lowercase    )
        return
    for index in range(__lowercase			,				len(__lowercase    )    ):
        create_state_space_tree(
            __lowercase			,				__lowercase			,				index + 1			,				[*path, nums[index]]			,				__lowercase			,				remaining_nums_sum - nums[index]			,				)
__a      :       str				  =   [3, 34, 4, 12, 5, 2]
__a      :       Optional[Any]				  =   9
__a      :       List[str]				  =   generate_sum_of_subsets_soln(nums, max_sum)






print(*result)




