int ans[12],n,k,data[12],f;
void search(int i,int s){
	int j;
	if(!s){
		for(f=j=1,printf("%d",ans[0]);j<k;j++)printf("+%d",ans[j]);
		printf("\n");
		return;
	}
	if(i>=n||s<0)return;
	for(j=i;j<n;j++)if(j==i||data[j]!=data[j-1]){//这里的处理避免了重复的情况：data[j]!=data[j-1])
		ans[k++]=data[j];
		search(j+1,s-data[j]);
		k--;
	}
}
void main(){
	int j,t;
	while(scanf("%d%d",&t,&n),t){
		f=k=0;
		for(j=0;j<n;j++)scanf("%d",&data[j]);
		printf("Sums of %d:\n",t);
		search(0,t);
		if(!f)printf("NONE\n");
	}
}