#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) REP(i, 0, a)
#define EACH(i, a) for (auto i: a)
#define ITR(x, a) for (__typeof(a.begin()) x = a.begin(); x != a.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define HAS(a, x) (a.find(x) != a.end())

int N, T;
int A[51];
ll dp[51][100005];

int main(void) {
  cin >> N;
  cin >> T;
  rep(i, N) cin >> A[i];
  rep(i, N) rep(j, T + 1) dp[i][j] = 1LL << 51;
  dp[0][A[0]] = 0;
  REP(i, 1, N) rep(j, T + 1) {
    if (j + A[i] <= T) dp[i][j + A[i]] = min(dp[i][j + A[i]], dp[i - 1][j]);
    if (j * A[i] <= T) dp[i][j * A[i]] = min(dp[i][j * A[i]], dp[i - 1][j] | 1LL << (i - 1));
  }

  string ans;
  rep(i, N - 1) ans += (dp[N - 1][T] >> i & 1 ? '*':'+');
  cout << ans << endl;
  return 0;
}