Recursive Subset Sum

Given a list of integers and a target sum, write a program that finds all unique subsets of the list whose elements sum to the target using a recursive approach. Each subset should be printed in a new line in ascending order and should include elements in the same order as they appeared in the input. Input format: - First line contains the target sum. - Second line contains the number of integers in the list. - Third line contains the list of integers. Output format: - Each unique subset that sums to the target. Example: Input: 7 5 2 3 4 7 5 Output: [2, 5] [3, 4] [7]