N = int(input())
T = int(input())
A = list(map(int, input().split()))
ans = []
tmp = []


def dfs(i, val):
    if i == N:
        if val == T:
            ans.append("".join(tmp))
        return

    if val + A[i] <= T:
        tmp.append("0")
        dfs(i + 1, val + A[i])
        tmp.pop()
    if val * A[i] <= T:
        tmp.append("1")
        dfs(i + 1, val * A[i])
        tmp.pop()


dfs(1, A[0])
answer = sorted(ans)[0]
print(answer.replace("0", "+").replace("1", "*"))