#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int n,t;
int a[55];
bool dp[55][1000010];

void solve(){
    cin >> n >> t;
    rep(i,n){
        cin >> a[i];
    }
    dp[0][0]=1;
    rep(i,n){
        rep(j,t+1){
            if (!dp[i][j]) continue;
            if (t>=j+a[i]) dp[i+1][j+a[i]]=true;
            if (t>=j*a[i] && j!=0) dp[i+1][j*a[i]]=true;
        }
    }
    string ans="";
    per(i,n){
        if(dp[i][t-a[i]]) {
            ans+="+";
            t-=a[i];
        }
        else {
            ans+="*";
            t/=a[i];
        }
        //cout << i << " " << t << endl;
    }
    rep(i,n-1){
        cout << ans[n-i-2] << "";
    }
}

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