Given the set S = {21, 22, 4, 15, 26, 14, 9, 23, 20, 31, 16, 3} 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.
