
def 				a						(							snake_case__:					int = 10						,   snake_case__:					int = 22					):


				'''simple docstring'''
				lowercase_       =					range(1						,   snake_case__					)
				lowercase_       =					range(1						,   snake_case__					)
				return sum(
				    1 for power in powers for base in bases if len(str(base**power					)					) == power					)


if __name__ == "__main__":
						print(f"{solution(1_0, 2_2) = }")






import itertools
import math




def 				a						(							snake_case__:					int					):


				'''simple docstring'''

				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5						,   int(math.sqrt(snake_case__					) + 1					)						,   6					):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True




def 				a						(							):


				'''simple docstring'''
				lowercase_       =					2
				while True:
								if is_prime(snake_case__					):
												yield num
								num += 1




def 				a						(							snake_case__:					int = 10_001					):


				'''simple docstring'''
				return next(itertools.islice(prime_generator()						,   nth - 1						,   snake_case__					)					)


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




