#include <bits/stdc++.h>
#define rep(i, a) rep2 (i, 0, a)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) repr2 (i, 0, a)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define asn(a, b, c) fill_n(&(b), sizeof(a) / sizeof(b), c)
using namespace std;
typedef long long ll;
const ll inf = 1e18;
const ll mod = 1e9 + 7;

template<typename T> inline bool umin(T &a, T b) { 
	return b < a && (a = b, true);
}

ll dp[55][101010];

int main() {
	const ll inf = 1ll << 60;
	asn(dp, **dp, inf);

	int N;
	int total;
	cin >> N >> total;

	vector<ll> A(N);
	rep (i, N) cin >> A[i];

	dp[0][A[0]] = 0;
	A.erase(A.begin());
	N--;

	rep (i, N) {
		rep (j, total + 1) {
			if (dp[i][j] == inf) continue;
			if (j + A[i] <= total) {
				umin(dp[i + 1][j + A[i]], dp[i][j] << 1 | 0);
			}
			if (j * A[i] <= total) {
				umin(dp[i + 1][j * A[i]], dp[i][j] << 1 | 1);
			}
		}
	}

	vector<int> ans;
	ll x = dp[N][total];
	rep (i, N) {
		ans.push_back(x & 1);
		x >>= 1;
	}
	reverse(ans.begin(), ans.end());

	rep (i, N) {
		if (ans[i] & 1) {
			cout << "*";
		} else {
			cout << "+";
		}
	}
	cout << endl;

	return 0;
}