from collections import defaultdict
import heapq
inf = 10 ** 18
N = int(input())
T = int(input())
A = list(map(int, input().split()))

dp = [[0] * (T + 1) for _ in range(N)]
dp[0][A[0]] = 1
for i in range(1, N):
    for s in range(1, T+1):
        if dp[i-1][s]:
            t = s * A[i]
            if t <= T:
                dp[i][t] = True
            t = s + A[i]
            if t <= T:
                dp[i][t] = True

ans = []
now = T
for i in reversed(range(N - 1)):
    if dp[i][now - A[i+1]]:
        now -= A[i+1]
        ans.append("+")
    else:
        now //= A[i+1]
        ans.append("*")

ans.reverse()
print("".join(ans))