uva 10419

沒有說要從小到大印出來

而是"字母排序"有小到大

//
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA
//     GGG::::::::::::G     CCC::::::::::::C              A:::A
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A
//G:::::G              C:::::C                        A:::::A:::::A
//G:::::G              C:::::C                       A:::::A A:::::A
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 30005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
#define X first
#define Y second
#define PSS pair<string,string>
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int prime[300],pnum;
bool seize[400]={};
int st[20];
int used[100];
void pre(){
    for(int i=2;i<=300;i++){
        if(!seize[i]){
            prime[pnum++]=i;
            for(int j=i+i;j<=300;j+=i){
                seize[j]=1;
            }
        }
    }
}
bool cm(int a,int b){
    char str[20],str2[20];
    sprintf(str,"%d",a);
    sprintf(str2,"%d",b);
    string sa(str),sb(str2);
    return sa<sb;
}
int n,t;
bool findit;
void dfs(int index,int now,int dep){
    if(findit)return;
    if(now==n&&dep==t){
        sort(st,st+t,cm);
        findit=true;
        printf("%d",st[0]);
        for(int i=1;i<t;i++)printf("+%d",st[i]);
        Pln();
        return;

    }
    if(dep>=t){
        return;
    }
    for(int i=index;i<pnum;i++){
        if(now+prime[i]>n)continue;
        if(findit)return;
        if(prime[i]==2&&used[i]<1){
            used[i]++;
            st[dep]=prime[i];
            dfs(i+1,now+prime[i],dep+1);
            used[i]--;
        }else if(prime[i]!=2&&used[i]<=1){
            used[i]++;
            st[dep]=prime[i];
            dfs(i,now+prime[i],dep+1);
            used[i]--;
        }
    }
}
int main() {
    pre();
    sort(prime,prime+pnum,cm);
    ios_base::sync_with_stdio(0);
    int ff=0;
    while(~scanf("%d%d",&n,&t)&&n+t){
        findit=false;
        Set(used,0);
        printf("CASE %d:\n",++ff);
        dfs(0,0,0);
        if(!findit)puts("No Solution.");
    }















}