#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define long int64_t
#define ulong uint64_t

const int N = 50;
int n, total, a[N];

void input()
{
    cin >> n >> total;
    rep(i, n) cin >> a[i];
}

const int inf = 1000000;

int min_a[N], max_c[N], max_d[N];

inline int min_result(int i, int cur) { return cur + min_a[i]; }
inline int max_result(int i, int cur) { return min<long>((long) max_c[i] * cur + max_d[i], inf); }

void prepare()
{
    min_a[n - 1] = a[n - 1] == 1 ? 0 : a[n - 1];
    max_c[n - 1] = a[n - 1] == 1 ? 1 : a[n - 1];
    max_d[n - 1] = a[n - 1] == 1 ? 1 : 0;
    for (int i = n - 2; i >= 0; --i) {
        min_a[i] = a[i] == 1 ? min_a[i + 1] : min_a[i + 1] + a[i];
        max_c[i] = a[i] == 1 ? max_c[i + 1] : min<long>((long) max_c[i + 1] * a[i], inf);
        max_d[i] = a[i] == 1 ? max_d[i + 1] + max_c[i + 1] : max_d[i + 1];
    }
}

bool dfs(int i, int cur)
{
    if (i == n) return cur == total;
    if (total < min_result(i, cur) or max_result(i, cur) < total) return false;
    return dfs(i + 1, cur + a[i]) or dfs(i + 1, cur * a[i]);
}

void solve()
{
    string tmp;
    while (n and total % a[n - 1] != 0) {
        tmp.push_back('+');
        total -= a[--n];
    }
    reverse(tmp.begin(), tmp.end());

    prepare();

    string ans;
    int cur = a[0];
    repi(i, 1, n) {
        if (dfs(i + 1, cur + a[i])) {
            ans.push_back('+'), cur += a[i];
        } else {
            ans.push_back('*'), cur *= a[i];
        }
    }
    ans.insert(ans.end(), tmp.begin(), tmp.end());
    cout << ans << endl;
}

int main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    input();
    solve();
}