package no010;

import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int total = sc.nextInt();
		int[] a = new int[n];
		for(int i=0;i<n;i++) {
			a[i] = sc.nextInt();
		}
		long[][] dp = new long[n][total+1];
		for(int i=0;i<n;i++) {
			Arrays.fill(dp[i], 1L<<60);
		}
		dp[0][a[0]] = 0;
		for(int i=0;i<n-1;i++) {
			for(int j=0;j<=total+1;j++) {
				if (j + a[i+1] <= total) {
					dp[i+1][j+a[i+1]] = Math.min(dp[i+1][j+a[i+1]],dp[i][j] * 2);
				}
				if (j * a[i+1] <= total) {
					dp[i+1][j*a[i+1]] = Math.min(dp[i+1][j*a[i+1]],dp[i][j] * 2 + 1);
				}
			}
		}
		StringBuilder sb = new StringBuilder();
		long ans = dp[n-1][total];
		for(int i=0;i<n-1;i++) {
			sb.append(ans % 2 == 0 ? '+' : '*');
			ans >>= 1;
		}
		sb.reverse();
		System.out.println(sb.toString());
	}
}