//http://yukicoder.me/problems/29
#include <iostream>
#include <queue>
#include <vector>
#include <string>
#include <tuple>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <cstdint>
#include <limits>

using namespace std;

int main()
{
	int N;
	cin >> N;
	int Total;
	cin >> Total;
	vector<int> A(N);
	for (int i = 0; i < N; i++) {
		cin >> A[i];
	}

	vector<vector<int64_t>> dp(N, vector<int64_t>(Total + 1, numeric_limits<int64_t>::max()));

	dp[0][A[0]] = 0;
	for (int i = 1; i < N; i++) {
		for (int j = 0; j < Total; j++) {
			if (dp[i-1][j] != numeric_limits<int64_t>::max()) {
				int n = j + A[i];
				if (n <= Total) {
					auto v = dp[i - 1][j];
					if (dp[i][n] > v)
						dp[i][n] = v;
				}
				int m = j * A[i];
				if (m <= Total) {
					auto v = dp[i - 1][j] | (1LL << (N - i));
					if (dp[i][m] > v)
						dp[i][m] = v;
				}
			}
		}
	}

	string ans;
	for (int i = 0; i < N-1; i++) {
		if (dp[N - 1][Total] & (1LL << (N-i-1)))
			ans += "*";
		else
			ans += "+";
	}
	cout << ans << endl;
	return 0;
}