#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < n; ++i)
using ll = long long;
using P = pair<int,int>;
string dp[50][100001];
int main() {
   int N,Total;cin>>N>>Total;
   vector<int>A(N);
   rep(i,N)cin>>A[i];
   dp[0][A[0]]="+";
   for (int i = 1; i < N; i++)
   {
      rep(j,Total+1){
         if(!dp[i-1][j].empty()){
            int plus=j+A[i];
            int multi=j*A[i];
            if(!dp[i][plus].empty()){
               if((dp[i-1][j]+'+')>dp[i][plus])
               dp[i][plus]=dp[i-1][j]+'+';
            }
            else if(plus<=Total)dp[i][plus]=dp[i-1][j]+'+';
            if(!dp[i][multi].empty()){
               if((dp[i-1][j]+'*')>dp[i][multi])
               dp[i][multi]=dp[i-1][j]+'*';
            }
            else if(multi<=Total)dp[i][multi]=dp[i-1][j]+'*';
         }
      }
   }
   dp[N-1][Total].erase(dp[N-1][Total].begin());
   cout<<dp[N-1][Total]<<endl;  
}