sum it up

#include <iostream>
#include <set>
#include <algorithm>
#include <string.h>
#include <queue>
using namespace std;
const int N = 1e5 + 5;
int arr[10005];
int ans[10005];
bool vis[10005];
int n, m;
bool flag;
int (int a,int b)
{
	return a > b;
}
void dfs(int num,int indexx,int end)
{
	if(num>n)
		return;
	if(num==n)
	{
		flag=true;
		cout << ans[1];
		for (int i = 2; i < end;i++)
		{
			cout << "+" << ans[i];
		}
		cout << "n";
		return;
	}
	for (int i = indexx; i <= m; i++)
	{
		if(i==indexx||arr[i-1]!=arr[i])
		{

			ans[end] = arr[i];
			dfs(arr[i] + num, i + 1, end + 1);
		}
	}
}
int main()
{
	while((cin>>n>>m),m,n)
	{
		for (int i = 1; i <= m;i++)
		{
			cin >> arr[i];
		}
		sort(arr + 1, arr + 1 + m,cmp);
		cout<<"Sums of "<<n<<":"<<endl;
		flag = false;
		dfs(0, 1, 1);
		//cout<<"---------"<<flag<<endl;
		if(!flag)
		{
			cout<<"NONE"<<endl;
		}
	}
}