#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = (1 << 30) - 1;
const ll INF = 1LL << 60;
//const int MOD = 1000000007;
const int MOD = 998244353;

int main() {
	int n, T;
	cin >> n >> T;
	vi a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	vvl dp(n + 1, vl(T + 1, INF));
	dp[1][a[0]] = 0;
	for (int i = 1; i < n; i++) {
		for (int j = 0; j <= T; j++) {
			if (dp[i][j] != INF) {
				if (j + a[i] <= T)
					dp[i + 1][j + a[i]] = min(dp[i + 1][j + a[i]], dp[i][j] << 1);
				if (j * a[i] <= T) {
					dp[i + 1][j * a[i]] = min(dp[i + 1][j * a[i]], (dp[i][j] << 1) + 1);
				}
			}
		}

	}

	bitset<60> bs(dp[n][T]);
	for (int i = n - 2; i >= 0; i--) {
		if (bs[i] == 0) cout << '+';
		else cout << '*';
	}
	cout << endl;

	return 0;
}