import std.stdio, std.conv, std.string, std.bigint;
import std.math, std.random, std.datetime;
import std.array, std.range, std.algorithm, std.container;
string read(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }

void main(){
	long n = read.to!long;
	long total = read.to!long;
	long[] as = readln.chomp.split.map!(to!long).array;
	
	long m = (n + 1) / 2;
	
	string[long] xs;
	xs[as[0]] = "";
	foreach(a; as[1 .. m]){
		string[long] xs_new;
		foreach(k; xs.keys){
			if(k + a !in xs_new || xs_new[k + a] < xs[k] ~ "+") xs_new[k + a] = xs[k] ~ "+";
			if(k * a !in xs_new || xs_new[k * a] < xs[k] ~ "*") xs_new[k * a] = xs[k] ~ "*";
		}
		xs = xs_new;
	}
	debug xs.writeln;
	
	string[long] ys;
	ys[total] = "";
	foreach_reverse(a; as[m .. n]){
		string[long] ys_new;
		foreach(k; ys.keys){
			if(k - a !in ys_new || ys_new[k - a] < "+" ~ ys[k]) ys_new[k - a] = "+" ~ ys[k];
			if(k % a == 0) if(k / a !in ys_new || ys_new[k / a] < "*" ~ ys[k]) ys_new[k / a] = "*" ~ ys[k];
		}
		ys = ys_new;
	}
	debug ys.writeln;
	
	long[] kxs = xs.keys;
	foreach(k; kxs){
		if(k in ys){
			(xs[k] ~ ys[k]).writeln;
			break;
		}
	}
	return;
}