#include <bits/stdc++.h>
using namespace std;
int N, T;
int A[50];
int dp[50][100000];
vector<int> zeros;
int64_t ans;
int recursive(int pos, int val, int64_t oper) {
	int retval = 0;
	if(pos >= N) {
		if(val == T) {
			ans = oper;
			return 1;
		}
		return 0;
	}
	if(dp[pos][val]) return 0;
	if(val > T) return 0;
	retval = recursive(pos + 1, val + A[pos], oper) ||
		     recursive(pos + 1, val * A[pos], oper | (1 << pos));
}

int main() {
	cin >> N >> T;
	for(int i = 0; i < N; i++) {
		cin >> A[i];
		for(int j = 0; j < T; j++) {
			dp[i][j] = 0;
		}
		if(A[i] == 0) zeros.push_back(i);
	}
	recursive(1, A[0], 0);
	for(int i = 1; i < N; i++) {
		cout << (ans & (1 << i) ? "*" : "+");
	}
	cout << endl;
	return 0;
}