#include <bits/stdc++.h>

int n;
int total;
int xs[64];
uint64_t prev[64][100100];

int main() {
  scanf("%d", &n);
  scanf("%d", &total);
  for(int i = 0; i < n; ++i) {
    scanf("%d", &xs[i]);
  }
 
  prev[0][xs[0]] = '!';
  for(int i = 1; i < n; ++i) {
    for(int j = 0; j < 100100; ++j) {
      int x1 = j + xs[i];
      int x2 = j * xs[i];
      uint64_t y1 = (prev[i-1][j] << 1) | 1ULL;
      uint64_t y2 = (prev[i-1][j] << 1);
      if( x1 < 100100 ) {
        prev[i][x1] = std::max(prev[i][x1], y1);
      }
      if( x2 < 100100 ) {
        prev[i][x2] = std::max(prev[i][x2], y2);
      }
    }
  }
  for(int i = n-1-1; i >= 0; --i) {
    putchar( (prev[n-1][total] & (1ULL << i)) ? '+' : '*' );
  }
  putchar('\n');

  return 0;
}