import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N = NI()
    T = NI()
    A = NLI()[::-1]
    SX = [[[], T]]
    ans = []
    for i, a in enumerate(A):
        if i == N-1:
            for S, x in SX:
                if x != a:
                    continue
                ans.append("".join(S[::-1]))
            continue

        SXn = []
        for S, x in SX:
            if x > a:
                S.append("0")
                SXn.append([S[:], x-a])
                S.pop()
            if x % a == 0:
                S.append("1")
                SXn.append([S[:], x//a])
                S.pop()
        SX = SXn
    ans.sort()
    print(ans[0].replace("0", "+").replace("1", "*"))


if __name__ == "__main__":
    main()