#55620: c++ 類dfs解 供參
#include <bits/stdc++.h>
using namespace std;
int num,target;
vector <char> c;
bool dp(int val,int idx,vector <int> &v){
if(val>32000||val<-32000)return false;
if(idx==num){
if(val==target){
for(int i=0;i<c.size();i++)cout<<v[i]<<c[i];
cout<<v[num-1]<<"="<<target<<endl;return true;
} return false;}
c.push_back('+');
if (dp(val + v[idx], idx + 1, v)) return true;
c.pop_back();
c.push_back('-');
if (dp(val - v[idx], idx + 1, v)) return true;
c.pop_back();
c.push_back('*');
if (dp(val * v[idx], idx + 1, v)) return true;
c.pop_back();
if (val % v[idx] == 0) {
c.push_back('/');
if (dp(val / v[idx], idx + 1, v)) return true;
c.pop_back();
}
return false;
}
int main() {
int t;
cin>>t;
while(t--){
cin>>num;
vector <int> v(num);
for(int i=0;i<num;i++)cin>>v[i];
cin>>target;
c.clear();
bool tmp=dp(v[0],1,v);
if(!tmp)cout<<"NO EXPRESSION"<<endl;
}
return 0;
}