#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;

class cBits{
public:
	vector<bool> b;
	cBits(const int n){
		REP(i, n) b.push_back(false);
	}
	void add(int digit){
		if(digit >= b.size()) return;
		if(b[digit]){
			b[digit] = false;
			add(digit + 1);
		}
		else b[digit] = true;
	}
	bool all(bool boo){
		bool ret = true;
		for(auto i: b){
			if(i != boo){
				ret = false;
				break;
			}
		}
		return ret;
	}
	bool isEmpty(){	return all(false);}
	bool isFull(){return all(true);}
};

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];

	cBits bits(N - 1);
	do{
		int result = 0;
		REP(i, N){
			if(i == 0){
				result += A[i];
			}
			else{
				if(!bits.b[i - 1]) result += A[i];
				else result *= A[i];
			}
		}
		if(result == total) break;
		bits.add(0);
	}while(!bits.isFull());

	for(auto i: bits.b){
		if(!i) cout << '+';
		else cout << '*';
	}
	cout << endl;

	return 0;
}