#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cctype>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rrep(i,n) for(int i = 1; i <= n; ++i)
#define drep(i,n) for(int i = n-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
inline int in() { int x; scanf("%d",&x); return x;}
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;

const int MX = 100015, INF = 1000010000;
const ll LINF = 1000000000000000000ll;
const double eps = 1e-10;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1}; //^<v>

int n, t;
int a[55];
int dp[55][MX];

int dfs(int i, int j) {
  if (i == n) return j==t;
  if (dp[i][j] != -1) return dp[i][j];
  {
    int x = j+a[i];
    if (x <= t && dfs(i+1,x)) return dp[i][j] = 1; 
  }
  {
    int x = j*a[i];
    if (x <= t && dfs(i+1,x)) return dp[i][j] = 1;
  }
  return dp[i][j] = 0;
}

int main(){
  cin >> n >> t;
  rep(i,n) scanf("%d",&a[i]);
  rep(i,n+1)rep(j,t+1) dp[i][j] = -1;
  string s;
  int x = a[0];
  rrep(i,n-1) {
    if (dfs(i+1,x+a[i])) {
      s += '+';
      x += a[i];
    } else {
      s += '*';
      x *= a[i];
    }
  }
  cout << s << endl;
  return 0;
}