#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;

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

  return 0;
}