#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int n,t;
int a[51];
vector<char> ans;
bool dfs(int ni,int now){
    //cout<<ni<<" "<<now<<endl;
    assert(ni<n);
    //cout<<ni<<endl;
    if(now>t) return false;
    int tmp = now + a[ni];
    int tt = now * a[ni];
    //cout<<ni<<" "<<a[ni]<<" "<<tmp<<endl;
    if(ni==n-1){
        //cout<<"aaa2"<<endl;
        if(tmp==t){
            ans.push_back('+');
            return true;
        }else if(tt==t){
            ans.push_back('*');
            return true;
        }
        return false;
    }else if(ni==0){
        return dfs(1,tmp);
    }else{
        ans.push_back('+');
        if(dfs(ni+1,tmp)) return true;
        ans.pop_back();
        ans.push_back('*');
        if(dfs(ni+1,tt)) return true;
        ans.pop_back();
        return false;
    }
    return false;
}

int main(){
    cin>>n>>t;
    //vector<int> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    dfs(0,0);
    for(int i = 0;i<ans.size();i++) cout<<ans[i];
    cout<<endl;
}