

from __future__ import annotations
def      _lowerCAmelCase(	__A   ,       __A			):
  UpperCAmelCase					      =  []
  UpperCAmelCase					      =  []
  UpperCAmelCase					      =  0
  UpperCAmelCase					      =  sum(__A			)
  create_state_space_tree(__A   ,       __A   ,       __A   ,       __A   ,       __A   ,       __A			)
  return result
def      _lowerCAmelCase(	__A   ,       __A   ,       __A   ,       __A   ,       __A   ,       __A   ,       ):
  if sum(__A			) > max_sum or (remaining_nums_sum + sum(__A			)) < max_sum:
    return
  if sum(__A			) == max_sum:
    result.append(__A			)
    return
  for index in range(__A   ,       len(__A			)			):
    create_state_space_tree(
        __A   ,       __A   ,       index + 1   ,       [*path, nums[index]]   ,       __A   ,       remaining_nums_sum - nums[index]   ,       )
lowerCAmelCase__       = [3, 34, 4, 12, 5, 2]
lowerCAmelCase__       = 9
lowerCAmelCase__       = generate_sum_of_subsets_soln(nums, max_sum)





print(*result)






def      _lowerCAmelCase(	__A			):
  assert column_title.isupper()
  UpperCAmelCase					      =  0
  UpperCAmelCase					      =  len(__A			) - 1
  UpperCAmelCase					      =  0

  while index >= 0:
    UpperCAmelCase					      =  (ord(column_title[index]			) - 64) * pow(26   ,       __A			)
    answer += value
    power += 1
    index -= 1

  return answer


if __name__ == "__main__":
      from doctest import testmod

      testmod()



