#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <bitset>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int MAX = 200000;
int N, total;
vector<int> A;
string m[300000];


signed main()
{
    cin >> N >> total;
    A.resize(N);
    REP(i,N) cin >> A[i];
    
    REP(i,MAX) m[i] = "";
    m[A[0]] = "+";
    FOR(i,1,N) {
        int a = A[i];
        REP(j,MAX) {
            string s = m[j];
            if (s.size() != i) continue;
            if (j * a < MAX) {
                m[j*a] = s + "*";
            }
            if (j + a < MAX) {
                m[j+a] = s + "+";
            }
            if (m[j].size() == i) {
                m[j] = "";
            }
        }
    }
    
    cout << m[total].substr(1) << endl;
    
    return 0;
}