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

int main() {
    using namespace std;
    int n, tot;
    cin >> n >> tot;
    vector<int> a(n);
    for (auto &e : a) { cin >> e; }

    vector<string> ans;
    auto dfs = [&](auto dfs, int n, int i, string s) -> void {
        if (i == 0 && n == a[i]) {
            reverse(s.begin(), s.end());
            ans.push_back(s);
            return;
        }
        if (a[i] < n) { dfs(dfs, n - a[i], i - 1, s + '+'); }
        if (n % a[i] == 0) { dfs(dfs, n / a[i], i - 1, s + '*'); }
    };
    dfs(dfs, tot, n - 1, "");

    sort(ans.begin(), ans.end(), [](auto lhs, auto rhs) {return lhs > rhs; });
    cout << ans[0] << endl;
}