#include <bits/stdc++.h>
using namespace std;
int main(void){
    int n,t,a;
    cin>>n>>t>>a;
    vector<long long>dp(t+1,1e18);
    dp[a]=0;
    for(int i=0;i<n-1;i++){
        int b;
        cin>>b;
        vector<long long>ndp(t+1,1e18);
        for(int j=0;j<=t;j++){
            if(dp[j]==1e18)continue;
            if(j+b<=t)ndp[j+b]=min(ndp[j+b],dp[j]);
            if(j*b<=t)ndp[j*b]=min(ndp[j*b],dp[j]+(1LL<<(long long)(n-2-i)));
        }
        dp=ndp;
    }
    for(long long i=n-2;i>=0;i--){
        cout<<((dp[t]&(1LL<<i))?"*":"+");
    }
    cout<<endl;
    return 0;
}