#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vl  = vector<ll>;
using vs  = vector<string>;
using vvi = vector<vi>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;

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; }

int dp[55][100010]; // dp[i][j] := i番目の数までを見たときにjが作れる

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    int N, Total; cin >> N >> Total;
    vi A(N); REP(i, N) cin >> A[i];

    dp[0][A[0]] = 1;
    for(int i = 1; i < N; i++)
    {
        for(int j = 0; j <= Total; j++)
        {
            if(dp[i-1][j] != 0)
            {
                if(j+A[i] <= Total) dp[i][j+A[i]] = 2;
                if(j*A[i] <= Total && dp[i][j*A[i]] == 0) dp[i][j*A[i]] = 3;
            }
        }
    }

    vector<char> ans;
    int s = N-1, t = Total;
    while(dp[s][t] != 1)
    {
        if(dp[s][t] == 2)
        {
            ans.pb('+');
            t -= A[s];
            s--;
        }
        else
        {
            ans.pb('*');
            t /= A[s];
            s--;
        }
    }
    RREP(i, (int)ans.size()) cout << ans[i];
    cout << endl;
}