#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000007
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define SIZE 10000

int dp[51][100000]; //1..* 2..+

int main(){
    int n,total;
    int A[SIZE];
    string ans;
    
    scanf("%d%d",&n,&total);

    for(int i=0;i<n;i++)
        scanf("%d",&A[i]);
    
    dp[1][A[0]]=1;
    
    for(int i=1;i<n;i++){
        
        for(int j=0;j<=total;j++){
            if(dp[i][j]==0) continue;
            
            if(j*A[i]<=total){
                dp[i+1][j*A[i]]=max(dp[i+1][j*A[i]],1);
            }
            
            if(j+A[i]<=total){
                dp[i+1][j+A[i]]=max(dp[i+1][j+A[i]],2);
            }
        }
    }
    
    
    
    for(int i=n;i>=2;i--){
        if(dp[i][total]==1){
            ans+='*';
            total/=A[i-1];
        }else{
            ans+='+';
            total-=A[i-1];
        }
    }
    
    reverse(ans.begin(),ans.end());
    
    cout << ans << endl;
    
    return 0;
}