/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.10.13 14:23:01
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n;cin >> n;
    int t;cin >> t;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int k = max(10,t);
    vector<vector<bool>> dp(n,vector<bool>(k+1,false));
    dp[0][a[0]] = true;
    for (int i = 0; i < n-1; i++) {
        for (int j = 0; j <= t; j++) {
            if (!dp[i][j]) continue;
            if (j + a[i+1] <= k) dp[i+1][j+a[i+1]] = true;
            if (j * a[i+1] <= k) dp[i+1][j*a[i+1]] = true;
        }
    }
    stack<int> sta;
    int now = t;
    vector<char> ans(n-1);
    for (int i = n - 2; i >= 0; i--) {
        if (dp[i][now-a[i+1]]) now -= a[i+1], ans[i] = '+';
        else if (now % a[i+1] == 0 && dp[i][now/a[i+1]]) now /= a[i+1], ans[i] = '*';
    }
    for (int i = 0; i < n-1; i++) {
        cout << ans[i];
    }
    cout << endl;
    return 0;
}