#include<stdio.h>
int t,n,num[20],flag,res[20];
void DFS( int p,int s,int nu )
{if( s == t ){flag = 1;for( int i = 0; i < nu; ++i )printf( i == 0 ? "%d" : "+%d",res[i] );puts( "" );return ;}for( int i = p; i < n ; ++i ){if( i > p && num[i] == num[i-1] )//这个就保证如果有相同的数,相同的组合,每个只用一次,而且是第一次continue;if( num[i] + s <= t )res[nu] = num[i],DFS( i+1,s + num[i],nu + 1 );}}
int main( )
{while( scanf( "%d%d",&t,&n ),t ){flag = 0;for( int i = 0; i < n; ++i )scanf( "%d",&num[i] );printf( "Sums of %d:\n",t );DFS( 0,0,0 );if( !flag )puts( "NONE" );}return 0;
}

#include<stdio.h>
#include<string.h>
int des[20],t,n,num[20],c,nu[20];
char ch[20][20];
void DFS( int x,int min )
{if( nu[x] == t ){int i ;for(  i = 0; i < x; ++i )ch[c][i] = nu[i+1] - nu[i];ch[c][i] = 0;int f = 1;for( int i = 0; i < c; ++i )if( strcmp( ch[i],ch[c] ) == 0 ){f = 0;break;}if( f )++c;return ;}else{for( int i = min; i < n; ++i ){if( !des[i] )if( nu[x] + num[i] <= t ){des[i] = 1;nu[x+1] = num[i] + nu[x];DFS( x + 1,i );des[i] = 0;}}}}
int cmp( char str1[],char str2[] )
{int len1 = strlen( str1 ),len2 = strlen( str2 );if( len1 != len2 )return len1 - len2;return strcmp( str2,str1 );
}
int main( )
{while( scanf( "%d%d",&t,&n ) , n ){c = 0;for( int i = 0; i < n; ++i )scanf( "%d",&num[i] ),des[i] = 0;nu[0] = 0;DFS( 0,0 );printf( "Sums of %d:\n",t );if( !c || !t ){puts( "NONE" );continue;}for( int i = 0; i < c; ++i ){for( int j = 0; j < strlen( ch[i] );++j )printf( j == 0 ?"%d": "+%d",ch[i][j] );puts( "" );}}return 0;
}