#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[8]={1,0,-1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a <= b) { a = b; return true; } return false; } set ans; void dfs(vector>> &dp,ll now,ll t, string str, vl &v){ if(now==0){ if(t==0){ if(*str.rbegin()=='*')return; str.pop_back(); rev(all(str)); ans.ins(str); } return; } for(auto p:dp[now][t]){ if(p==1)str+='+',dfs(dp,now-1,t-v[now-1],str,v),str.pop_back(); if(p==2)str+='*',dfs(dp,now-1,t/v[now-1],str,v); } } int main(){ ll n,tot;cin >> n >>tot; vl v(n);rep(i,n)cin >>v[i];//rev(all(v)); vector>> dp(n+1,vector>(100010)); dp[0][0].ins(-1); rep(i,n){ rep(j,100010){ if(dp[i][j].empty())continue; if(j+v[i]<=100009)dp[i+1][j+v[i]].ins(1); if(j*v[i]<=100009)dp[i+1][j*v[i]].ins(2); } } string s; dfs(dp,n,tot,s,v); //for(auto p:ans)cout << p <