#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, total;
	cin >> N >> total;
	VI A(N);
	REP(i, N) cin >> A[i];

	const LL MAX = 1LL << N;
	vector<LL> dp(total + 1, MAX);
	dp[A[0]] = 0;
	REP(i, N){
		vector<LL> dp2(total + 1, MAX);
		REP(j, total + 1){
			if(dp[j] != MAX){
				if(j + A[i] <= total) dp2[j + A[i]] = min(dp2[j + A[i]], dp[j] * 2);
				if(j * A[i] <= total) dp2[j * A[i]] = min(dp2[j * A[i]], dp[j] * 2 + 1);
			}
		}
		dp = dp2;
	}

	REP(i, N - 1){
		if((dp[total] >> (N - i - 2)) % 2 == 0) cout << '+';
		else cout << '*';
	}

	cout << endl;

	return 0;
}