// Template {{{
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
using namespace std;
typedef long long LL;

#ifdef LOCAL
#include "contest.h"
#else
#define dump(x) 
#endif

class range {
    struct Iterator {
        int val, inc;
        int operator*() {return val;}
        bool operator!=(Iterator& rhs) {return val < rhs.val;}
        void operator++() {val += inc;}
    };
    Iterator i, n;
    public:
    range(int e) : i({0, 1}), n({e, 1}) {}
    range(int b, int e) : i({b, 1}), n({e, 1}) {}
    range(int b, int e, int inc) : i({b, inc}), n({e, inc}) {}
    Iterator& begin() {return i;}
    Iterator& end() {return n;}
};

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
inline bool valid(int x, int w) { return 0 <= x && x < w; }

void iostream_init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.setf(ios::fixed);
    cout.precision(12);
}
//}}}

typedef unsigned long long ULL;
int main(){
    iostream_init();

    int N, T;
    while(cin >> N >> T){
        T++;
        ULL dp[100010] = {};
        memset(dp, -1, sizeof(dp));
        N--;

        int INI;
        cin >> INI;
        dp[INI] = 0;

        REP(i, N) {
            int A;
            cin >> A;

            ULL next[100010] = {};
            memset(next, -1, sizeof(next));

            REP(j, T) if(dp[j] != ULLONG_MAX) {
                int nj = j + A;
                if(nj < T) {
                    next[nj] = min(next[nj], dp[j] << 1);
                }
            }
            REP(j, T) if(dp[j] != ULLONG_MAX) {
                int nj = j * A;
                if(nj < T) {
                    next[nj] = min(next[nj], (dp[j] << 1) | 1);
                }
            }
            memcpy(dp, next, sizeof(dp));
        }

        REP(i, N) cout << ((dp[T-1] >> (N-1-i) & 1) ? "*" : "+");
        cout << endl;

    }
    return 0;
}

/* vim:set foldmethod=marker: */