from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    n=II()
    tot=II()
    aa=LI()
    dp=[[-1]*(tot+1) for _ in range(n)]
    dp[0][aa[0]]=0
    for i,a in enumerate(aa[1:]):
        for j in range(tot+1):
            pre=dp[i][j]
            if pre==-1:continue
            val=pre<<1|1
            nj=j+a
            if nj<=tot and val>dp[i+1][nj]:dp[i+1][nj]=val
            val=pre<<1
            nj=j*a
            if nj<=tot and val>dp[i+1][nj]:dp[i+1][nj]=val
    val=dp[n-1][tot]
    ans=""
    for _ in range(n-1):
        if val&1:ans+="+"
        else: ans += "*"
        val>>=1
    print(ans[::-1])

main()