#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


bool dp[50][100001];

int main(){
	int n,total,a[50];
	string ans;
	cin>>n>>total;
	rep(i,n)cin>>a[i];
	int v=a[0];
	rep(i,n-1){
		memset(dp,false,sizeof(dp));
		dp[i+1][v+a[i+1]]=true;
		for(int j=i+1;j<n-1;j++)rep(k,100001)if(dp[j][k]){
			if(k+a[j+1]<=100000)dp[j+1][k+a[j+1]]=true;
			if(k*a[j+1]<=100000)dp[j+1][k*a[j+1]]=true;	
		}
		if(dp[n-1][total]){
			ans+='+';
			v+=a[i+1];
		}
		else{
			ans+='*';
			v*=a[i+1];
		}
	}
	cout<<ans<<endl;
	return 0;
}