#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>

using namespace std;

string dp[2][100001];
int main(){
  int N;
  cin >> N;
  int T;
  cin >> T;
  int A[N];
  for( int i = 0 ; i < N ; i++ ) cin >>A[i];
  for( int i = 0 ; i <2; i++ ) for( int j = 0 ; j <=T; j++ ) dp[i][j] = "-";
  dp[0][A[0]]="";
  for( int k = 0; k+1 <N ; k++ ){
    int i = k%2;
    for( int j = 0 ; j <=T; j++ ) dp[1-i][j]="-";
    for( int j = 0 ; j <=T; j++){
      if( dp[i][j]!="-"){
        if( j+A[k+1] <= T ){
          if( dp[1-i][j+A[k+1]] == "-" ) dp[1-i][j+A[k+1]]=dp[i][j]+"+";
          else dp[1-i][j+A[k+1]]=max(dp[1-i][j+A[k+1]],dp[i][j]+"+");
        }
        if( j*A[k+1] <= T ){
          if( dp[1-i][j*A[k+1]] == "-" ) dp[1-i][j*A[k+1]]=dp[i][j]+"*";
          else dp[1-i][j*A[k+1]]=max(dp[1-i][j*A[k+1]],dp[i][j]+"*");
        }
      }
    }
    //for( int j = 0 ; j <=T; j++ ) cout <<j<<"="<< dp[1-i][j] << ", ";
    //cout << endl;

  }
  cout << dp[(N-1)%2][T]<<endl;

  return 0;
}