





from __future__ import annotations






def 			_SCREAMING_SNAKE_CASE						(     SCREAMING_SNAKE_CASE						:list[int]       ,       SCREAMING_SNAKE_CASE						:int       )     ->       list[list[int]]:
 __lowerCAmelCase	:			list[list[int]]         =  []
 __lowerCAmelCase	:			list[int]         =  []
 __lowerCAmelCase	:			Any         =  0
 __lowerCAmelCase	:			Union[str, Any]         =  sum(SCREAMING_SNAKE_CASE       )
 create_state_space_tree(SCREAMING_SNAKE_CASE       ,       SCREAMING_SNAKE_CASE       ,       SCREAMING_SNAKE_CASE       ,       SCREAMING_SNAKE_CASE       ,       SCREAMING_SNAKE_CASE       ,       SCREAMING_SNAKE_CASE       )
 return result






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





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







print(*result)



"""simple docstring"""



import math
from collections.abc import Iterator
from itertools import takewhile







def     __lowerCAmelCase		(		lowercase    :    int					)      ->		bool:


    """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(lowercase					) + 1					)		,				6					):
        if number % i == 0 or number % (i + 2) == 0:
            return False
    return True







def     __lowerCAmelCase		(		)      ->		Iterator[int]:


    """simple docstring"""





    snake_case       : Optional[int]    =       2
    while True:
        if is_prime(lowercase					):
            yield num
        num += 1







def     __lowerCAmelCase		(		lowercase    :    int = 200_0000					)      ->		int:


    """simple docstring"""





    return sum(takewhile(lambda lowercase					: x < n		,				prime_generator()					)					)


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





