#include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
#include<ctime>
#include<set>
using namespace std;


#define li			long long int
#define rep(i,to)	for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)	for(li i=(li)(start);i<((li)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define F first
#define S second
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl

li dp[55][100100];
li a[55];

string decode(li x, li keta){
	string res="";
	for(li i=keta-1; i>=0; i--){
		if(((1ll<<i)&x)>0)res+='*';
		else res+='+';
	}
	return res;
}

int main(){
	li inf=1ll<<55;
	li n,total;
	cin>>n>>total;
	rin{cin>>a[i];}

	rep(i,n+1){
		rep(j,100001)dp[i][j]=inf;
	}

	dp[0][0]=0;
	rep(i,n){
		rep(j,100001){
			if(dp[i][j]<inf && j+a[i]<=total){
				dp[i+1][j+a[i]]=min(dp[i+1][j+a[i]],(dp[i][j]<<1));
			}
			if(dp[i][j]<inf && j*a[i]<=total){
				dp[i+1][j*a[i]]=min(dp[i+1][j*a[i]],(dp[i][j]<<1)+1);
			}
		}
	}

	cout<<decode(dp[n][total], n-1)<<endl;

	return 0;
}