import sys

N = int(input())
Total = int(input())
A = list(map(int, input().split()))
dp = [[0 for _ in range(Total + 1)] for _ in range(N + 1)]

def dfs(ops, cur, v):
    if v > Total:
        return
    if cur == N:
        if v == Total:
            print(ops) 
            sys.exit()
        return
    if dp[cur][v]:
        return
    
    dp[cur][v] = 1
    ops += '+'
    dfs(ops, cur + 1, v + A[cur])
    ops = ops[0 : -1]
    
    ops += '*'
    dfs(ops, cur + 1, v * A[cur])
    ops = ops[0 : -1]

ops = ''
dfs(ops, 1, A[0])