#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const LL mod=1000000007;
const LL LINF=1LL<<62;
const int INF=1<<30;
int dx[]={1,0,-1,0,1,-1,1,-1};
int dy[]={0,1,0,-1,1,-1,-1,1};
 
bool f(string a,string b){
    if(a.length() < b.length()) return true;
    int n = a.length();
    for (int i = 0; i < n; i++) {
        if(a[i] < b[i]) return true;
        else if(a[i] > b[i]) return false;
    }
    return true;
}

int main(){
    int n;cin >> n;
    int x;cin >> x;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vector<string> dp(x+1,"");
    dp[a[0]] = ".";
    for (int i = 1; i < n; i++) {
        for (int j = x; j >= 0; j--) {
            if(dp[j].length() < i) continue;
            if(j + a[i] <= x){
                if(f(dp[j + a[i]], dp[j] + "+")){
                    dp[j + a[i]] = dp[j] + "+";
                }
            }
            if(j * a[i] <= x){
                if(f(dp[j * a[i]], dp[j] + "*")){
                    dp[j * a[i]] = dp[j] + "*";
                }
            }
        }
    }
    cout << dp[x].substr(1) << endl;
    return 0;
}