#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
string dp[51][100010];
string comin(string A,string B){//A.size == B.size が前提
  if(A.empty())return B;
  if(B.empty())return A;
  for(int i = 0; A.size() > i; i++){
    if(A[i] == '+' && B[i] == '*')return A;
    if(A[i] == '*' && B[i] == '+')return B;
  }
  return A;
}
int main(){
  int N,T;cin>>N>>T;
  int A[N];
  for(int i = 0; N > i; i++){
    cin>>A[i];
  }
  dp[0][A[0]] = '!';
  for(int i = 1; N > i; i++){
    for(int j = 0; T >= j; j++){
      if(dp[i-1][j].empty())continue;
      if(j+A[i] <= T)dp[i][j+A[i]] = comin(dp[i][j+A[i]],dp[i-1][j] + "+");
      if(j*A[i] <= T)dp[i][j*A[i]] = comin(dp[i][j*A[i]],dp[i-1][j] + "*");
    }
  }
  cout << dp[N-1][T].substr(1,N-1) << endl;
}