#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <bitset>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

vi A;
int Total;
char memo[51][100001];
char rec(int i, int x) {
	if(x > Total) return 0;
	char &r = memo[i][x];
	if(r != -1) return r;
	if(i == A.size())
		return r = x == Total;
	r = 0;
	int a = A[i];
	r |= rec(i+1, x + a);
	r |= rec(i+1, x * a);
	return r;
}

string construct(int i, int x) {
	if(i == A.size())
		return "";
	int a = A[i];
	if(rec(i+1, x + a))
		return "+" + construct(i+1, x + a);
	else
		return "*" + construct(i+1, x * a);
}

int main() {
	int N;
	while(cin >> N) {
		cin >> Total;
		A.resize(N);
		rep(i, N) cin >> A[i];
		mset(memo, -1);
		rec(1, A[0]);
		string ans = construct(1, A[0]);
		puts(ans.c_str());
	}
	return 0;
}