//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>

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<int>> dp(N, vector<int>(Total + 1, -1));

	dp[0][A[0]] = 0;
	for (int i = 1; i < N; i++) {
		for (int j = 0; j < Total; j++) {
			if (dp[i-1][j] != -1) {
				int n = j + A[i];
				if (n <= Total)
					dp[i][n] = dp[i - 1][j];
				int m = j * A[i];
				if (m <= Total)
					dp[i][m] = dp[i - 1][j] | (1 << (i - 1));
			}
		}
	}

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