



"""simple docstring"""

def __lowercase    (							_a = 10	,    _a = 22					):
    snake_case_				:  Union[str, Any]       =			range(1	,    _a					)
    snake_case_				:  int       =			range(1	,    _a					)
    return sum(
        1 for power in powers for base in bases if len(str(base**power					)					) == power					)


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










"""simple docstring"""

def __lowercase    (							_a	,    _a					):
    snake_case_				:  str       =			[0 for i in range(r + 1					)]
    # nc0 = 1
    snake_case_				:  int       =			1
    for i in range(1	,    n + 1					):
        # to compute current row from previous row.
        snake_case_				:  Any       =			min(_a	,    _a					)
        while j > 0:
            c[j] += c[j - 1]
            j -= 1
    return c[r]






print(binomial_coefficient(n=10, r=5))





