#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <random>

#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for (int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for (int (i) = (a) - 1; (i) >= (b); (i)--)
#define PI acos(-1.0)
#define DEBUG(C) cerr << C << endl;
#define VI vector <int>
#define VII vector <VI>
#define VL vector <LL>
#define VLL vector <VL>
#define VD vector <double>
#define VDD vector <VD>
#define PII pair <int, int>
#define PDD pair <double, double>
#define PLL pair <LL, LL>
#define VPII vector <PII>
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EB emplace_back
#define FORE(a, b) for (auto &&a : b)
#define FIND(s, n) (s.find(n) != s.end())

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

const int MAX_N = 100010;
int N, T;
VI A;

int dp[55][MAX_N];
//dp[i][j] = dp[i - 1][]までとA[i]を使ってjが作れるか(*2:plus , *2+1:mul)

int main(void) {
	cin >> N >> T;
	A.resize(N);
	REP(i, N) cin >> A[i];
	REP(i, 55) fill(dp[i], dp[i] + MAX_N, INF);
	dp[0][A[0]] = 1;
	FOR(i, 1, N) {
		REP(j, MAX_N) {
			if (dp[i - 1][j] == INF) continue;
			if (j + A[i] <= T) {
				dp[i][j + A[i]] = min(dp[i][j + A[i]], dp[i - 1][j] * 2);
			}
			if (j * A[i] <= T) {
				dp[i][j * A[i]] = min(dp[i][j * A[i]], dp[i - 1][j] * 2 + 1);
			}
		}
	}
	string ans = "";
	int now = dp[N - 1][T];
	while (now) {
		if (now & 1) {
			ans += '*';
			now = (now - 1) / 2;
		} else {
			ans += '+';
			now /= 2;
		}
	}
	ans.pop_back();
	REVERSE(ans);
	cout << ans << endl;
}