Given the set S = {11, 32, 12, 30, 8, 23, 3, 26, 21, 9, 5, 35} and target T = 46:

Find all subsets of S that sum to exactly T. Use a backtracking algorithm that explores the full search tree. For each solution found, emit the subset and verify its sum. Report the total number of solutions.
