Harry Potter and the Prisoner of Azkaban(English)

     Harry Sanders in a ceremony in the life of Maggie's aunt Lai Zuoke then become more terror, even though the wizard Harry know that minors can not be used outside the Hogwarts School of Witchcraft and Wizardry Magic, but Maggie Kazakhstan Lee's parents relentless irony and an insult to his unconscious use of the magic - he was so Inflation Maggie, Maggie Piaodao the air.
      Harry Sanders ran out of the ceremony, and boarded a bus to London Knights, on the road, he heard about a little known criminals wizard Sirius Black, is said to have used a spell to kill the 13 individuals, to escape Of Azkaban prison. Harry found that the use of his magic was not to punish the Ministry of Magic.
      Soon, Harry has to know why - Sirius Black is looking for him, the Ministry of Magic is more concerned about the security of Harry, and not concerned about whether he used the magic of the aunt. Magic circles are now stuck in panic, informed the Minister of Magic "Muggle" (no magic people) British Prime Minister Tony Blake escape. Hogwarts Dementors have been protected. Over time, Harry has been found that Black and Voldemort's own parents have a relationship.
      Harry was found in the story of Sirius Black is no small crime, prison Azkaban wrong when people turn. The real criminals (with a personal mantra killed 13 people) is a small dwarf Peter. Peter will address Harry's parents told Voldemort caused their deaths.
      So given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], then there are four different sums that equal 4: 4,3+1,2+2, and 2+1+1.(A number can be used within a sum as many times as it appears in the list, and a single number counts as a sum.) Your job is to solve this problem in general.

     The input will contain one or more test cases, one per line. Each test case contains t, the total, followed by n, the number of integers in the list, followed by n integers x1,...,xn. If n=0 it signals the end of the input; otherwise, t will be a positive integer less than 1000, n will be an integer between 1 and 12(inclusive), and x1,...,xn will be positive integers less than 100. All numbers will be separated by exactly one space. The numbers in each list appear in nonincreasing order, and there may be repetitions.

     For each test case, first output a line containing 'Sums of', the total, and a colon. Then output each sum, one per line; if there are no sums, output the line 'NONE'. The numbers within each sum must appear in nonincreasing order. A number may be repeated in the sum as many times as it was repeated in the original list. The sums themselves must be sorted in decreasing order based on the numbers appearing in the sum. In other words, the sums must be sorted by their first number; sums with the same first number must be sorted by their second number; sums with the same first two numbers must be sorted by their third number; and so on. Within each test case, all sums must be distince; the same sum connot appear twice.