Given the set S = {20, 3, 14, 25, 8, 19, 32, 13, 5, 6, 17, 18} and target T = 49:

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.
