#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

string result = "";

int N,total;
int memo[51][100000+1];

int dfs(const VI& A, int pos, int x){
    if(x > total) return 0;
    if(pos == N){
        return x == total;
    }
    int& ret = memo[pos][x];
    if(ret != -1) return ret;
    if(dfs(A, pos+1, x + A[pos])){
        result += "+";
        return 1;
    }
    if(dfs(A, pos+1, x * A[pos])){
        result += "*";
        return 1;
    }

    return ret = 0 ;
}

int main()
{
    cin>>N>>total;
    VI A(N);
    FOR(i,N) cin>>A[i];
    memset(memo , -1 , sizeof(memo));
    dfs(A, 1, A[0]);
    reverse(ALL(result));
    cout<<result<<endl;
    return 0;
}