def read_data():
    N = int(input())
    total = int(input())
    A = list(map(int, input().split()))
    return N, total, A

def solve(N, total, A):
    dp = [set() for i in range(N)]
    dp[0].add(A[0])
    dp[-1].add(total)
    backcast(dp, N, A)
    path = forecast(dp, N, A)
    return path

def backcast(dp, N, A):
    for i in range(N-1, 0, -1):
        dpn = dp[i-1]
        a = A[i]
        for b in dp[i]:
            if b > a:
                dpn.add(b - a)
            if b % a == 0:
                dpn.add(b // a)

def forecast(dp, N, A):
    pos = 1
    val = A[0]
    path = []
    dfs(val, pos, path, dp, A)
    return ''.join(path)

def dfs(val, pos, path, dp, A):
    if pos == len(dp):
        return True
    a = A[pos]
    if val + a in dp[pos]:
        path.append('+')
        if dfs(val + a, pos + 1, path, dp, A):
            return True
        del path[-1]
    if val * a in dp[pos]:
        path.append('*')
        if dfs(val * a, pos + 1, path, dp, A):
            return True
        del path[-1]
    return False

N, total, A = read_data()
print(solve(N, total, A))