#include <iostream>
#include <string>
using namespace std;
int N,number[60],total;
int dp[60][100001];
bool sign=false;
string plus_times[61];
int recursion(int locate,int now){
        if(sign)return sign;
        if(dp[locate][now])return dp[locate][now];
        if(now==total && locate==N )return sign=true;
        if(locate==N)return sign;
        bool response=false;
        plus_times[locate]="+";
        response|=recursion(locate+1,now+number[locate]);
        if(response)
                return dp[locate][now]=response;
        plus_times[locate]="*";
        response|=recursion(locate+1,now*number[locate]);
        return dp[locate][now]=response;
}
int main(){
        cin >> N >> total;
        for(int i=0 ; i<N ; i++ )
                cin >> number[i];
        recursion(1,number[0]);
        for(int i=0 ; i<N ; i++ )
                cout << plus_times[i];
        cout << endl;
        return 0;
}