#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < int(n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define repeat_from_reverse(i,m,n) for (int i = (n)-1; (i) >= int(m); --(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using namespace std;
int main() {
    int n, total; cin >> n >> total;
    vector<int> a(n); repeat (i,n) cin >> a[i];
    function<int (int, int)> upper_bound = [&](int i, int acc) { return i == n or acc == total+1 ? acc : upper_bound(i+1, min(total+1, max(acc + a[i], acc * a[i]))); };
    string result;
    function<bool (int, int)> go = [&](int i, int acc) {
        if (i == n) return acc == total;
        int r = upper_bound(i, acc);
        if (acc <= total and total <= r) {
            result.push_back('+');
            if (go(i+1, acc + a[i])) return true;
            result.pop_back();
            result.push_back('*');
            if (go(i+1, acc * a[i])) return true;
            result.pop_back();
        }
        return false;
    };
    go(1, a[0]);
    cout << result << endl;
    return 0;
}