#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const int N = 1e5 + 10;
int dp[55][N];
int prv[55][N];
int a[55];

int n;
void restore(int i, int val){
	if (i > 0){
		int pval = prv[i][val] ? val / a[i - 1] : val - a[i - 1];
		restore(i - 1, pval);
		if(i > 1) cout << (prv[i][val] ? '*' : '+');
		//cout << a[i-1];
	}
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int total;
	cin >> n >> total;

	rep(i, n) cin >> a[i];

	MEMSET(prv, -1);
	dp[1][a[0]] = 1;
	FOR(i, 1, n){
		rep(j, total){
			if (!dp[i][j]) continue;
			if (j * a[i] <= total){
				dp[i + 1][j * a[i]] = 1;
				prv[i + 1][j * a[i]] = 1;
			}
		}
		rep(j, total){
			if (!dp[i][j]) continue;
			if (j + a[i] <= total){
				dp[i + 1][j + a[i]] = 1;
				prv[i + 1][j + a[i]] = 0;
			}
		}
	}

	restore(n, total);
	cout << endl;

	return 0;
}