#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

unsigned int randxor() {
    static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned int t;
    t = (x ^ (x << 11));
    x = y;
    y = z;
    z = w;
    return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}

void solve() {
    int n;
    ll s;
    cin >> n >> s;
    vl a(n);
    rep(i, n) cin >> a[i];
    vector dp(n + 1, vector<int>(s + 1, 0));
    dp[0][0] = 1;
    rep(i, n) rep(j, s + 1) if (dp[i][j]) {
        if (a[i] + j <= s) dp[i + 1][a[i] + j] |= dp[i][j];
        if (j != 0 && a[i] * j <= s) dp[i + 1][a[i] * j] |= dp[i][j];
    }
    assert(dp[n][s]);
    dp[n][s] = 2;
    repr(i, n) rep(j, s + 1) {
        if (a[i] + j <= s) dp[i][j] |= dp[i + 1][a[i] + j];
        if (j != 0 && a[i] * j <= s) dp[i][j] |= dp[i + 1][a[i] * j];
    }
    assert(dp[1][a[0]]);
    string ans;
    int cur = a[0];
    REP(i, 1, n) {
        if (cur + a[i] <= s && (dp[i + 1][cur + a[i]] >> 1)) {
            ans += '+';
            cur += a[i];
        } else if (cur * a[i] <= s && (dp[i + 1][cur * a[i]] >> 1)) {
            ans += '*';
            cur *= a[i];
        } else {
            assert(false);
        }
    }
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}