void main() {
	enum INF = 10L ^^ 18;
	const N = readInt;
	const T = readInt;
	auto A = new int[N];
	foreach (i; 0 .. N) A[i] = readInt;
	auto dp = new long[][](N + 1, T + 1);
	foreach (i; 0 .. N + 1) foreach (j; 0 .. T + 1) dp[i][j] = INF;
	dp[0][0] = 0;
	foreach (i; 0 .. N) foreach (j; 0 .. T + 1) {
		if (j + A[i] <= T) {
			chmin(dp[i + 1][j + A[i]], dp[i][j] * 2);
		}
		if (j * A[i] <= T) {
			chmin(dp[i + 1][j * A[i]], dp[i][j] * 2 + 1);
		}
	}
	string ans;
	foreach_reverse (i; 0 .. N - 1) {
		ans ~= (dp[N][T] & 1L << i ? "*" : "+");
	}
	ans.writeln;
}

import std,core.bitop;
string[]_R;
string readString(){while(_R.empty){_R=readln.chomp.split;}auto ret=_R.front;_R.popFront;return ret;}
int readInt(){return readString.to!int;}
long readLong(){return readString.to!long;}
ulong readULong(){return readString.to!ulong;}
real readReal(){return readString.to!real;}
bool chmin(T)(ref T A,T B){if(A>B){A=B;return true;}else{return false;}}
bool chmax(T)(ref T A,T B){if(A<B){A=B;return true;}else{return false;}}
int lowerBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<x?L:R)=mid;}return R;}
int upperBound(T)(T[]A,T x){int L=-1,R=cast(int)A.length;while(R-L>1){int mid=(L+R)/2;(A[mid]<=x?L:R)=mid;}return R;}