#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int n, T, a[55];
bool ng[55][100010];

bool dfs(int cur, int val, string &s){
    if(cur == n){
        if(val == T){
            cout << s << "\n";
            return true;
        }
        ng[cur][val] = true;
        return false;
    }
    int nxt = val + a[cur];
    if(nxt <= T && !ng[cur+1][nxt]){
        s += '+';
        if(dfs(cur+1, nxt, s)) return true;
        s.pop_back();
    }
    nxt = val * a[cur];
    if(nxt <= T && !ng[cur+1][nxt]){
        s += '*';
        if(dfs(cur+1, nxt, s)) return true;
        s.pop_back();
    }
    ng[cur][val] = true;
    return false;
}

int main(){
    scanf("%d%d", &n, &T);
    rep(i, n) scanf("%d", &a[i]);
    rep(i, n+1)rep(j, T+1) ng[i][j] = false;
    string ans;
    dfs(1, a[0], ans);
}