#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1e9+7;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int main(){
    int n, T;
    scanf("%d%d", &n, &T);
    int a[n];
    rep(i, n) scanf("%d", &a[i]);
    char dp[n][T+1];
    rep(i, n)rep(j, T+1) dp[i][j] = '#';
    dp[0][a[0]] = '+';
    rep(i, n-1)rep(j, T+1)if(dp[i][j] != '#'){
        if(j+a[i+1] <= T) chmax(dp[i+1][j+a[i+1]], '+');
        if(j*a[i+1] <= T) chmax(dp[i+1][j*a[i+1]], '*');
    }
    string ans;
    for(int i=n-1, j=T; i>=1; --i){
        ans += dp[i][j];
        if(dp[i][j] == '+') j -= a[i];
        else j /= a[i];
    }
    reverse(ans.begin(), ans.end());
    cout << ans << "\n";
}