#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <functional>
#include <tuple>
#include <climits>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <iomanip>

using namespace std;


enum Operation {
    sum = 0,
    product = 1
};

void next(std::vector<Operation> &op)
{
    for(int i=op.size()-1; i>=0 ;i--) {
        if(op[i]==sum) {
            op[i] = product;
            break;
        }
        op[i] = sum;
    }
}

std::vector<Operation> solve(std::vector<int> f, int total)
{
    std::vector<Operation> op(f.size()-1, sum);

    while(true) {
        int answer=f[0];
        for(int i=1;i<f.size();i++) {
            if(op[i-1] == sum) answer += f[i];
            else answer *= f[i];
        }
        if(answer == total) break;
        next(op);
    }

    return op;
}

int main()
{
    int N, Total;
    cin >> N;
    cin >> Total;
    vector<int> A(N);
    for(auto &a : A) cin >> a;
    auto op = solve(A, Total);
    for(const auto& o : op)
        cout << (o==sum?"+":"*");
    cout << endl;
}