#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n; cin >> n;
    int total; cin >> total;
    vector<int> a(n);
    for (auto &ai: a) cin >> ai;
    string ans;
    vector<vector<bool>> dp(n, vector<bool>(total + 1));
    auto dfs = [&](auto dfs, int i, int res) {
        if (res > total) return ;
        if (i == n) {
            if (res == total) cout << ans << endl, exit(0);
            return ;
        }
        if (dp[i][res]) return ;
        dp[i][res] = true;
        ans += '+', dfs(dfs, i + 1, res + a[i]), ans.pop_back();
        ans += '*', dfs(dfs, i + 1, res * a[i]), ans.pop_back();
    };
    dfs(dfs, 1, a[0]);
    return 0;
}