#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <string>
#include <map>
#include <queue>
#include <iomanip>
#include <numeric>
#include <memory>
#include <limits.h>
#include <set>
#include <cassert>
#include <cmath>
#include <bitset>
#include <functional>
#include <limits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define REP(i,n) for(ll i=0; i<(n); ++i)
#define TEN(x) ((ll)1e##x)
#define ALL(v) (v).begin(), (v).end()

// 1では無く1ULLにしないとバグる
bool bit_check(ull x, int i) { return x & 1ULL << i; }
ull bit_flip(ull x, int i) { return x | 1ULL << i; }

int main(){
	ll n, total;
	cin >> n >> total;
	vector<ll> a(n);
	for (auto&i : a) cin >> i;
	vector<vector<uint64_t>> dp(total+1, vector<uint64_t>(n, numeric_limits<uint64_t>::max()));
	dp[a[0]][0] = 0;
	REP(i,n-1) REP(j, total + 1) {
		auto v = dp[j][i];
		if (j + a[i + 1] <= total && dp[j + a[i + 1]][i + 1] > v) dp[j + a[i + 1]][i + 1] = v;
		v = bit_flip(v, n - 2 - i);
		if (j * a[i + 1] <= total && dp[j * a[i + 1]][i + 1] > v) dp[j * a[i + 1]][i + 1] = v;
	}

	for (ll i = n - 2; i >= 0; --i) cout << (bit_check(dp[total][n - 1], i) ? "*" : "+");
	
	cout << endl;
	return 0;
}