#include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) ((int)(a).size())
#define PB(a) push_back(a)
#define EB(...) emplace_back(__VA_ARGS__)
#define MP(a, b) make_pair(a, b)
#define MT(...) make_tuple(__VA_ARGS__)
#define Bit(n) (1LL << (n))
using namespace std;
using pii = pair<int, int>;
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const int MOD = 1000000007;
const int INF = 1LL << 30;
const double EPS = 1e-10;

int N;
int T;
int A[50];
int dp[51][100010];
using P = tuple<int, int, int>;
P pre[51][100010];

signed main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  cin >> N >> T;
  REP(i, N) cin >> A[i];
  
  fill_n((P*)pre, 51*100010, MT(-1,-1,-1));
  dp[0][1] = 1;
  pre[0][1] = MT(-1, -1, -1);
  REP(i, N) REP(j, T+1) if (dp[i][j]) {
    if (j*A[i] <= T) {
      dp[i+1][j*A[i]] |= dp[i][j];
      int y, x, t;
      tie(y, x, t) = pre[i+1][j*A[i]];
      if (t == 0) continue;
      pre[i+1][j*A[i]] = MT(i, j, 1);
    }
    if (i && j+A[i] <= T) {
      dp[i+1][j+A[i]] |= dp[i][j];
      pre[i+1][j+A[i]] = MT(i, j, 0);
    }
  }
  int y = N, x = T;
  string s;
  while (y > 0) {
    int py, px, pt;
    tie(py, px, pt) = pre[y][x];
    if (pt == 0) s = "+" + s;
    else s = "*" + s;
    y = py; x = px;
  }
  cout << s.substr(1) << endl;

  return 0;
}