#include<bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

const int MX = 110000;
int n, total, a[50], dp[51][MX];

int rec(int c, int s){
	if(c == n) return s == total ? 0 : inf;
	if(dp[c][s] != -1) return dp[c][s];
	
	if(s + a[c] < MX && rec(c + 1, s + a[c]) < inf) return dp[c][s] = 0;
	if(s * a[c] < MX && rec(c + 1, s * a[c]) < inf) return dp[c][s] = 1;
	return dp[c][s] = inf;
}

int main(){
	cin >> n >> total;
	rep(i, n) cin >> a[i];
	
	memset(dp, -1, sizeof(dp));
	rec(1, a[0]);
	
	string ans;
	int s = a[0];
	rep(i, n - 1){
		
		if(dp[i + 1][s] == 0){
			ans += "+";
			s += a[i + 1];
		}
		else{
			ans += "*";
			s *= a[i + 1];
		}
	}
	cout << ans << endl;
	
	return 0;
}