#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;

//dp[i][j] := i　番目まで見て、+の数が　j 個
bool dp[55][100010];

int n, total, a[55];

int main(void){
	cin >> n >> total;
	rep(i, n) cin >> a[i];

	rep(i, 55)rep(j, 100010)dp[i][j] = false;
	dp[n - 1][total] = true;

	for (int i = n - 1; i >= 1; --i){
		for (int j = 0; j <= total; ++j){
			if(dp[i][j]){
				if(0 <= j - a[i]){
					dp[i - 1][j - a[i]] = true;
				}
				if(0 <= j / a[i]){
					dp[i - 1][j / a[i]] = true;
				}
			}
		}
	}

	vector<int> ans;
	int now = a[0];

	for (int i = 0; i < n - 1; ++i){
		// printf("%d\n", now);
		if(now + a[i + 1] <= total){
			if(dp[i + 1][now + a[i + 1]]){
				ans.pb(0);
				now += a[i + 1];
				continue;
			}
		}
		if(now * a[i + 1] <= total){
			ans.pb(1);
			now *= a[i + 1];
			continue;
		}
	}
	rep(i, ans.size()){
		if(ans[i] == 0){
			printf("+");
		}else{
			printf("*");
		}
	}
	printf("\n");
	return 0;
}