def solve(N, T, A):
    memo = {}

    def able(i, j):
        if (i, j) in memo:
            return memo[i, j]
        memo[i, j] = False
        if i == N:
            if j == T:
                memo[i, j] = True
        else:
            if j + A[i] <= T and able(i + 1, j + A[i]):
                memo[i, j] = True
            if j * A[i] <= T and able(i + 1, j * A[i]):
                memo[i, j] = True
        return memo[i, j]

    ans = []
    j = A[0]
    for i in range(1, N):
        if j + A[i] <= T and able(i + 1, j + A[i]):
            ans.append('+')
            j += A[i]
            continue
        if j * A[i] <= T and able(i + 1, j * A[i]):
            ans.append('*')
            j *= A[i]
            continue
    return ''.join(ans)


def main():
    n = int(input())
    total = int(input())
    a = list(map(int, input().split()))
    print(solve(n, total, a))


if __name__ == '__main__':
    main()