#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N, x; cin >> N >> x;
	vector<int> A(N);
	for (int i = 0; i < N; i++)
		cin >> A[i];
	vector< vector<int> > dp(N + 1, vector<int>(100001));
	dp[N][x] = 3;
	for (int i = N - 1; i >= 0; i--)
		for (int j = 0; j <= 100000; j++) {
			if (j + A[i] <= 100000 && dp[i + 1][j + A[i]])
				dp[i][j] += 1;
			if ((ll)j * A[i] <= 100000 && dp[i + 1][j * A[i]])
				dp[i][j] += 2;
		}
	int j = A[0];
	for (int i = 1; i < N; i++)
		if (dp[i][j] % 2) {
			cout << '+';
			j += A[i];
		}
		else {
			cout << '*';
			j *= A[i];
		}
	cout << endl;
}