#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

int main(){
    int N,T;cin>>N>>T;
    vector<vector<int>> prev(N+1,vector<int>(T+1,-1));
    vector<int> A(N);
    REP(i, N) cin >> A[i];
    prev[1][A[0]]=0;
    REP(i,N){
        REP(j,T+1) if(prev[i][j]!=-1){
            if(j+A[i]<=T) prev[i+1][j+A[i]]=j;
        }
        REP(j,T+1) if(prev[i][j]!=-1){
            if(j*A[i]<=T&&prev[i+1][j]==-1) prev[i+1][j*A[i]]=j;
        }
    }
    int j=T;
    string ans;
    for(int i=N;i>1;--i){
        int k=prev[i][j];
        if(j==A[i-1]+k) ans+='+';
        else ans+='*';
        j=k;
    }
    reverse(All(ans));
    cout<<ans<<endl;
}