def rev(lists, times, goal, num, ans=[]): # リスト 何回目 最終的な値 数値 答えの記録 if times == len(lists) and goal == num: ans.append(True) return ans elif times == len(lists): ans.append(False) return ans for i in range(2): if i == 0: tmp = rev(lists, times+1, goal, num+lists[times], ans+['+']) elif i == 1: tmp = rev(lists, times+1, goal, num*lists[times], ans+['*']) if tmp != None: if tmp[-1]: return tmp n = int(input()) total = int(input()) a = list(map(int, input().split())) # ans = rev(a, 0, total, st) # [print(i, end='') for i in ans[:-1:]] # print() dp = [['' for i in range(total + 1)] for j in range(n + 1)] dp[2][a[0] + a[1]] = '+' dp[2][a[0] * a[1]] = '*' ans = [] for i in range(2, n): for j in range(total + 1): for k in range(2): if k == 0: if len(dp[i][j]) != 0 and j * a[i] <= total: dp[i + 1][j * a[i]] = dp[i][j] + '*' if i + 1 == n and j * a[i] == total: ans.append(dp[i + 1][j * a[i]]) if k == 1: if len(dp[i][j]) != 0 and j + a[i] <= total: dp[i + 1][j + a[i]] = dp[i][j] + '+' if i + 1 == n and j + a[i] == total: ans.append(dp[i + 1][j + a[i]]) ans.sort(reverse = True) print(ans[0])