#include<cstdio>
#include<iostream>

const long long INF = 1001001001001001001;

int N, total, A[50];
bool can[50][100001];
long long ope[50][100001];

int main(){
    scanf("%d %d", &N, &total);

    for(int i=0;i<N;i++){scanf("%d", A+i);}

    std::fill(&can[0][0], &can[0][0]+50*100001, false);
    std::fill(&ope[0][0], &ope[0][0]+50*100001, INF);
    can[0][A[0]] = true;
    ope[0][A[0]] = 0ll;
    for(int i=1;i<N;i++){
        for(int j=0;j<=total;j++){
            if(j - A[i] >= 0 && can[i-1][j-A[i]]){
                can[i][j] = true;
                ope[i][j] = std::min(ope[i][j], ope[i-1][j-A[i]] << 1);
            }
            if(j % A[i] == 0 && can[i-1][j/A[i]]){
                can[i][j] = true;
                ope[i][j] = std::min(ope[i][j], (ope[i-1][j/A[i]] << 1) + 1ll);
            }
        }
    }
    
    // for(int i=0;i<N;i++){
    //     for(int j=0;j<=total;j++){
    //         printf("%d ", can[i][j]);
    //     }
    //     puts("");
    // }

    for(int i=N-2;i>=0;i--){
        if(ope[N-1][total] >> i & 1){putchar('*');}
        else{putchar('+');}
    }
    puts("");
}