#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(int i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(int i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll N,Total;cin>>N>>Total;vector<ll>A(N);REP(i,N)cin>>A[i];
  vector<vector<string>>DP(N,vector<string>(1e5+1,"!"));DP[0][A[0]]="";
  FOR(i,1,N){
    REP(j,1e5+1-A[i])if(DP[i-1][j]!="!")DP[i][j+A[i]]=max(DP[i][j+A[i]],DP[i-1][j]+'+');
    REP(j,1e5/A[i]+1)if(DP[i-1][j]!="!")DP[i][j*A[i]]=max(DP[i][j*A[i]],DP[i-1][j]+'*');
  }
  cout<<DP[N-1][Total]<<endl;
  return 0;
}