#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = (ll)(1e+9) + 7; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; typedef pair LDP; string dp[1<<17]; bool exi[1 << 17]; bool chked[1 << 17]; int a[50]; const int key = 1 << 17; int main(){ int n; cin >> n; int s; cin >> s; rep(i, n) { cin >> a[i]; } exi[a[0]] = true; rep1(i, n-1) { fill(chked, chked + (1 << 17), false); per(j, (1 << 17)) { if (!exi[j])continue; if (j + a[i] < key) { exi[j + a[i]] = true; if (!chked[j + a[i]]) { dp[j + a[i]] = dp[j] + "+"; chked[j + a[i]] = true; } else { dp[j + a[i]] = max(dp[j + a[i]], dp[j] + "+"); } } if (j*a[i] < key) { exi[j*a[i]] = true; if (!chked[j *a[i]]) { dp[j * a[i]] = dp[j] + "*"; chked[j * a[i]] = true; } else { dp[j *a[i]] = max(dp[j * a[i]], dp[j] + "*"); } } } } cout << dp[s] << endl; return 0; }