/* -*- coding: utf-8 -*-
 *
 * 10.cc: No.10 +か×か - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 50;
const int MAX_T = 100000;

/* typedef */

typedef long long ll;

/* global variables */

int as[MAX_N];
ll dp[MAX_N][MAX_T + 1];

/* subroutines */

/* main */

int main() {
  int n, t;
  cin >> n >> t;

  for (int i = 0; i < n; i++) cin >> as[i];

  memset(dp, -1, sizeof(dp));
  dp[0][as[0]] = 0;

  for (int i = 0; i < n - 1; i++)
    for (int j = 0; j <= t; j++)
      if (dp[i][j] >= 0) {
	int add = j + as[i + 1];
	ll dpa = (dp[i][j] << 1);
	if (add <= t &&
	    (dp[i + 1][add] < 0 || dp[i + 1][add] > dpa))
	  dp[i + 1][add] = dpa;

	int mul = j * as[i + 1];
	ll dpm = ((dp[i][j] << 1) | 1);
	if (mul <= t &&
	    (dp[i + 1][mul] < 0 || dp[i + 1][mul] > dpm))
	  dp[i + 1][mul] = dpm;
      }

  ll ans = dp[n - 1][t];
  for (int i = n - 2; i >= 0; i--)
    putchar((ans & (1LL << i)) == 0 ? '+' : '*');
  putchar('\n');

  return 0;
}