#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>
#include <map>

using namespace std;

int memo[51][100020];

int total;
vector <int> a;
vector <char> ans;
bool rec(int i, int val) {
  if (memo[i][val] != -1) return memo[i][val];
  if (i == a.size()-1) {
    if (val == total) {
      return true;
    }
    return false;
  }

  if (val+a[i+1] <= total && rec(i+1, val+a[i+1])) {
    ans.push_back('+');
    return memo[i][val]=true;
  }
  if (val*a[i+1] <= total && rec(i+1, val*a[i+1])) {
    ans.push_back('*');
    return memo[i][val]=true;
  }

  return memo[i][val]=false;
}

int main() {
  memset(memo, -1, sizeof(memo));
  int n;
  cin >> n;
  cin >> total;
  for (int i = 0; i < n; i++) {
    int x; cin >> x; a.push_back(x);
  }

  rec(0, a[0]);

  for (int i = ans.size()-1; i >= 0; i--) cout << ans[i];
  cout << endl;
}