#include #include #include using namespace std; #define REP(i, n) for(int(i)=0;(i)<(n);++(i)) int N, total, A[51]; bool memo[51][100100]; string s; void dfs(int i, int num){ if(num > total) return; if(memo[i][num]) return; if(i == N){ if(num == total){ cout << s << endl; exit(0); } return; } s.push_back('+'); dfs(i+1, num + A[i]); s.pop_back(); s.push_back('*'); dfs(i+1, num * A[i]); s.pop_back(); memo[i][num] = true; } int main(){ cin >> N >> total; REP(i,N) cin >> A[i]; dfs(1,A[0]); return 0; }