






'''simple docstring'''
from __future__ import annotations





def 	_a(					UpperCamelCase__			:  list[int],		UpperCamelCase__			:  int							):




      '''simple docstring'''






      SCREAMING_SNAKE_CASE__       :			list[list[int]]													=[]
      SCREAMING_SNAKE_CASE__       :			list[int]													=[]
      SCREAMING_SNAKE_CASE__       :			List[Any]													=0
      SCREAMING_SNAKE_CASE__       :			List[Any]													=sum(UpperCamelCase__							)
      create_state_space_tree(UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__,		UpperCamelCase__							)
      return result





def 	_a(					UpperCamelCase__			:  list[int],		UpperCamelCase__			:  int,		UpperCamelCase__			:  int,		UpperCamelCase__			:  list[int],		UpperCamelCase__			:  list[list[int]],		UpperCamelCase__			:  int,		):




      '''simple docstring'''






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







print(*result)







'''simple docstring'''
def 	_a(					UpperCamelCase__			:  Optional[Any]=2_8_1_2_3							):




      '''simple docstring'''






      SCREAMING_SNAKE_CASE__       :			List[Any]													=[1] * (limit + 1)

      for i in range(2,		int(limit**0.5							) + 1							):
            sum_divs[i * i] += i
            for k in range(i + 1,		limit // i + 1							):
                  sum_divs[k * i] += k + i

      SCREAMING_SNAKE_CASE__       :			List[str]													=set()
      SCREAMING_SNAKE_CASE__       :			str													=0

      for n in range(1,		limit + 1							):
            if sum_divs[n] > n:
                  abundants.add(UpperCamelCase__							)

            if not any((n - a in abundants) for a in abundants							):
                  res += n

      return res


if __name__ == "__main__":
  print(solution())