#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 <map>

using namespace std;

map <vector <char>, bool> memo;

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

  p.push_back('+');
  if (rec(p, val+a[p.size()])) {
    p.pop_back();
    return memo[p]=true;
  }
  p.pop_back();
  p.push_back('*');
  if (rec(p, val*a[p.size()])) {
    p.pop_back();
    return memo[p]=true;
  }

  return false;
}

int main() {
  int n;
  cin >> n;
  cin >> total;
  for (int i = 0; i < n; i++) {
    int x; cin >> x; a.push_back(x);
  }

  vector <char> p;
  rec(p, a[0]);

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