



"""simple docstring"""






def   snake_case__     (	__lowerCamelCase       :					int = 10							,	__lowerCamelCase       :					int = 22			):
			"""simple docstring"""
			lowerCamelCase__	:	Optional[Any]				=range(1							,	__lowerCamelCase			)
			lowerCamelCase__	:	str				=range(1							,	__lowerCamelCase			)
			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) = }')









"""simple docstring"""






from __future__ import annotations

from collections.abc import Iterator

class  __SCREAMING_SNAKE_CASE			:


					'''simple docstring'''





					def __init__( self							:						str,						lowerCamelCase							:						int  )->      None:
								lowerCamelCase__	:	str				=value
								lowerCamelCase__	:	Node | None				=None
								lowerCamelCase__	:	Node | None				=None





class  __SCREAMING_SNAKE_CASE			:


					'''simple docstring'''





					def __init__( self							:						int,						lowerCamelCase							:						Node  )->      None:
								lowerCamelCase__	:	Any				=tree



					def 	snake_case ( self							:						str,						lowerCamelCase							:						Node | None  )->      int:
								if node is None:
											return 0
								return node.value + (
								    self.depth_first_search(node.left  ) + self.depth_first_search(node.right  )
								)




					def __iter__( self							:						Dict  )->      Iterator[int]:
								yield self.depth_first_search(self.tree  )


if __name__ == "__main__":
		import doctest

		doctest.testmod()




