#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;
int n;
int a[51];
char ans[50];
bool rec(int i, int val) {
  if (memo[i][val] != -1) return memo[i][val];
  if (i == n-1) {
    return (val == total);
  }

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

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

int main() {
  memset(memo, -1, sizeof(memo));
  scanf ("%d", &n);
  scanf ("%d", &total);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);

  rec(0, a[0]);
  printf ("%s\n", ans);
}