



def      _A				(UpperCamelCase		:      int = 2000000 )  ->int:



			'''simple docstring'''







			lowerCamelCase__ :      Optional[int]								=		[0 for i in range(n + 1 )]
			lowerCamelCase__ :      Dict								=		1
			lowerCamelCase__ :      Any								=		1

			for i in range(2      ,			int(n**0.5 ) + 1 ):
						if primality_list[i] == 0:
									for j in range(i * i      ,			n + 1      ,			UpperCamelCase ):
												lowerCamelCase__ :      Union[str, Any]								=		1
			lowerCamelCase__ :      Union[str, Any]								=		0
			for i in range(UpperCamelCase ):
						if primality_list[i] == 0:
									sum_of_primes += i
			return sum_of_primes


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








def      _A				(UpperCamelCase		:      List[Any]      ,			UpperCamelCase		:      Dict )  ->List[str]:



			'''simple docstring'''







			lowerCamelCase__ :      int								=		[1]
			for i in range(2      ,			UpperCamelCase ):
						factorials.append(factorials[-1] * i )
			assert 0 <= k < factorials[-1] * n, "k out of bounds"

			lowerCamelCase__ :      Union[str, Any]								=		[]
			lowerCamelCase__ :      Optional[Any]								=		list(range(UpperCamelCase ) )

			# Find permutation
			while factorials:
						lowerCamelCase__ :      Union[str, Any]								=		factorials.pop()
						lowerCamelCase__							,lowerCamelCase__ :      Union[str, Any]								=		divmod(UpperCamelCase      ,			UpperCamelCase )
						permutation.append(elements[number] )
						elements.remove(elements[number] )
			permutation.append(elements[0] )

			return permutation


if __name__ == "__main__":
				import doctest

				doctest.testmod()



