#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

int n;
int t;
std::vector<int> a(50, -1);
std::string s;

bool solve(int r, int i) {
    if (r > t) {
        return false;
    }
    if (i == n) {
        if (r == t) {
            return true;
        } else {
            return false;
        }
    }

    if (solve(r + a[i], i + 1)) {
        s.push_back('+');
        return true;
    } else if (solve(r * a[i], i + 1)) {
        s.push_back('*');
        return true;
    } else {
        return false;
    }

} 

int main() {
    std::cin >> n >> t;
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    int r = a[0];
    if(!solve(r, 1)) {
        return 1;
    }
    std::reverse(s.begin(), s.end());
    std::cout << s << std::endl;

}