#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<string>
#include<queue>
#include<stack>

using namespace std;

#define INF 999999999
#define REP(i,n) for(int i=0; i<(int)(n); i++)

int main(){
	int i, j;
	int in[50], total, n;
	vector <string> bf(100001);
	vector <string> af(100001);
	cin >> n;
	cin >> total;
	for(i = 0; i < n; i++) cin >> in[i];
	bf[in[0] * in[1]] = "*";
	bf[in[0] + in[1]] = "+";
	for(i = 2; i < n; i++){
		for(j = 0; j <=total; j++){
			if(bf[j].length()>0){
				if(j * in[i] <= total){
					if ((bf[j] + "*") > af[j* in[i]]) af[j* in[i]] = bf[j] + "*";
				}
				if(j + in[i] <= total){
					if ((bf[j] + "+") > af[j+ in[i]]) af[j+ in[i]] = bf[j] + "+";
				}
			}
		}
		for(j = 0; j <=total; j++){
			bf[j] = af[j];
			af[j] = "";
		}
	}
	cout << bf[total] << endl;
	return 0;
}