#include <bits/stdc++.h>

int n;
int total;
int xs[64];

char prev[64][100100];

int main() {
  scanf("%d", &n);
  scanf("%d", &total);
  for(int i = 0; i < n; ++i) {
    scanf("%d", &xs[i]);
  }
 
  // step 2
  prev[0][xs[0]] = '!';
  for(int i = 1; i < n; ++i) {
    for(int j = 0; j < 100100; ++j) {
      if( prev[i-1][j] == '\0' ) continue;
      // printf("(i, j) = (%d, %d)\n", i, j);
      int x1 = j + xs[i];
      int x2 = j * xs[i];
      if( x1 < 100100 ) {
        // printf("(i, x1) = (%d, %d)\n", i, x1);
        prev[i][x1] = std::max(prev[i][x1], '+');
      }
      if( x2 < 100100 ) {
        // printf("(i, x2) = (%d, %d)\n", i, x2);
        prev[i][x2] = std::max(prev[i][x2], '*');
      }
    }
    // for(int j = 0; j < 32; ++j) {
    //   printf("%c", prev[i][j]);
    // }
    // printf("\n");
  }

  std::string ans;
  int x = total;
  for(int i = n - 1; i >= 1; --i) {
    // printf("#(i, x, prev[i][x]) = (%d, %d, %c)\n", i, x, prev[i][x]);
    char c = prev[i][x];
    ans += c;
    if( c == '+' ) x -= xs[i];
    if( c == '*' ) x /= xs[i];
  }
  std::reverse(ans.begin(), ans.end());

  printf("%s\n", ans.c_str());

  return 0;
}