



"""simple docstring"""





from __future__ import annotations
def      a__			(   lowerCAmelCase__			,    lowerCAmelCase__   ):
      UpperCAmelCase_    				=							[]
      UpperCAmelCase_    				=							[]
      UpperCAmelCase_    				=							0
      UpperCAmelCase_    				=							sum(lowerCAmelCase__   )
      create_state_space_tree(lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__   )
      return result
def      a__			(   lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    ):
      if sum(lowerCAmelCase__   ) > max_sum or (remaining_nums_sum + sum(lowerCAmelCase__   )) < max_sum:
            return
      if sum(lowerCAmelCase__   ) == max_sum:
            result.append(lowerCAmelCase__   )
            return
      for index in range(lowerCAmelCase__			,    len(lowerCAmelCase__   )   ):
            create_state_space_tree(
                lowerCAmelCase__			,    lowerCAmelCase__			,    index + 1			,    [*path, nums[index]]			,    lowerCAmelCase__			,    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)









"""simple docstring"""





from __future__ import annotations
def      a__			(   lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__   ):
      UpperCAmelCase_    				=							[]
      UpperCAmelCase_				,					UpperCAmelCase_    				=							input_list[low:mid], input_list[mid : high + 1]
      while left and right:
            result.append((left if left[0] <= right[0] else right).pop(0   )   )
      UpperCAmelCase_    				=							result + left + right
      return input_list
def      a__			(   lowerCAmelCase__   ):
      if len(lowerCAmelCase__   ) <= 1:
            return input_list
      UpperCAmelCase_    				=							list(lowerCAmelCase__   )

      # iteration for two-way merging
      UpperCAmelCase_    				=							2
      while p <= len(lowerCAmelCase__   ):
            # getting low, high and middle value for merge-sort of single list
            for i in range(0			,    len(lowerCAmelCase__   )			,    lowerCAmelCase__   ):
                  UpperCAmelCase_    				=							i
                  UpperCAmelCase_    				=							i + p - 1
                  UpperCAmelCase_    				=							(low + high + 1) // 2
                  UpperCAmelCase_    				=							merge(lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__   )
            # final merge of last two parts
            if p * 2 >= len(lowerCAmelCase__   ):
                  UpperCAmelCase_    				=							i
                  UpperCAmelCase_    				=							merge(lowerCAmelCase__			,    0			,    lowerCAmelCase__			,    len(lowerCAmelCase__   ) - 1   )
                  break
            p *= 2

      return input_list


if __name__ == "__main__":
  lowerCamelCase      =		input("""Enter numbers separated by a comma:\n""").strip()
  if user_input == "":
    lowerCamelCase      =		[]
  else:
    lowerCamelCase      =		[int(item.strip()) for item in user_input.split(""",""")]
  print(iter_merge_sort(unsorted))




