#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <set>
#include <map>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

int N, tot;
vector<int> A;
std::string dp[550][55];

std::string dfs(int now, int idx, string const& str) {
  auto& ret = dp[now][idx];
  if(!ret.empty()) { return ret; }
  ret = "1111111111111111111111111111111111111111111111111111111111111111111111";
  if(idx == N) {
    if(tot != now) { return ret; }
    return ret = str;
  }
  return ret = min(dfs(now+A[idx], idx+1, str + "0"), dfs(now*A[idx], idx+1, str + "1"));
}

int main() {

  cin >> N >> tot;
  rep(i, N) {
    int a; cin >> a;
    A.push_back(a);
  }

  auto ans = dfs(A[0], 1, "");
  rep(i, ans.size()) {
    cout << (ans[i] == '0' ? '+' : '*');
  }
  cout << endl;

  return 0;
}