poj 1564

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,ok,len,a[101],b[101];


void solve(int len,int k,int last){
if(last == 0){
ok = 0;
for(int i = 0;i<len;++i){
if(i == 0)
cout<<b[i];
else
cout<<"+"<<b[i];
}
cout<<endl;
}
for(int i = k;i<m;++i){
if((i == k||a[i] != a[i-1]) && last-a[i] >= 0){
b[len] = a[i];
solve(len+1,i+1,last-a[i]);
}
}
}


int main(){
while(cin>>n>>m){
if(n == 0&&m == 0)
break;
for(int i = 0;i<m;++i)
cin>>a[i];
memset(b,0,sizeof(b));
ok = 1;
printf("Sums of %d:\n", n);
solve(0,0,n);
if(ok) cout<<"NONE\n";
}
return 0;
}