#include<iostream>
#include<vector>
#include<cmath>
#include<climits>
#include<algorithm>
#include<queue>
#include<tuple>

using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))

int n;
int t;
vi a;

bool memo[51][100001] ={};

void dfs(int now,string ans){
  int s = ans.size();
  if(memo[s][now]) return;
  if(s == n-1 && now == t){cout << ans << endl; exit(1);}
  if(s == n-1) return;
  memo[s][now] = 1;
  //SHOW(now,n);
  if(now+a[s+1] <= t)
    dfs(now+a[s+1],ans + "+");
  if(now*a[s+1] <= t)
    dfs(now*a[s+1],ans + "*");
  return;
}

int main(){
  cin >> n >> t;
  rep(i,n){int in; cin >> in; a.pb(in);}
  dfs(a[0],"");
  return 0;
}