def solve(total, a):
    stack = [(total, len(a) - 1, [])]

    ans = []
    while stack:
        t, i, h = stack.pop()

        if i == 0:
            if t == a[0]:
                ans.append(h)
        else:
            if t % a[i] == 0:
                h2 = list(h)
                h2.append('*')
                stack.append((t // a[i], i - 1, h2))
            if t > a[i]:
                h2 = list(h)
                h2.append('+')
                stack.append((t - a[i], i - 1, h2))

    ans.sort()
    return ''.join(ans[-1][::-1])


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

    print(solve(total, a))


if __name__ == '__main__':
    main()