#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=1005;
int x[MAXN], solv[MAXN];
int t, n;
bool flag;
bool cmp(int a,int b)
{
    return a>b;
}
void dfs(int nt,int deep,int p)
{
    int i;
    if(nt==t)
    {
        sort(solv+1,solv+deep,cmp);
        printf("%d",solv[1]);
        for(i=2; i<deep; i++)
        {
            printf("+%d",solv[i]);
        }
        puts("");
        flag=true;
        return ;
    }
    for(i=p+1; i<=n; i++)
    {
        solv[deep]=x[i];
        dfs(nt+x[i],deep+1,i);
        while(i<n&&x[i]==x[i+1]) i++;
    }
}
int main()
{
    int i, j;
    while(scanf("%d%d",&t,&n)&&(t||n))
    {
        flag=false;
        for(i=1; i<=n; i++)
            scanf("%d",&x[i]);
        sort(x+1,x+n+1,cmp);
        printf("Sums of %d:\n",t);
        dfs(0,1,0);
        if(!flag) printf("NONE\n");
    }
    return 0;
}