#include #include #define all(a) begin(a),end(a) #define fin(...) rr vo(pp(__VA_ARGS__)) #define ep(...) emplace(__VA_ARGS__) #define eb(...) emplace_back(__VA_ARGS__) #define ef(...) else if(__VA_ARGS__) #define wh(...) while(__VA_ARGS__) #define ov4(a,b,c,d,e,...) e #define fo1(b) for(ll ii=0,bb=(ll)(b);ii=0;--i) #define of3(i,a,b) for(ll i=(ll)(a)-1,bb=(ll)(b);i>=bb;--i) #define of4(i,a,b,c) for(ll i=(ll)(a)-1,bb=(ll)(b),cc=(ll)(c);i>=bb;i-=cc) #define of(...) ov4(__VA_ARGS__,of4,of3,of2)(__VA_ARGS__) #define fe2(v,a) for(auto&&a:v) #define fe3(v,...) for(auto&&[__VA_ARGS__]:v) #define fe(v,...) ov4(__VA_ARGS__,fe3,fe3,fe3,fe2)(v,__VA_ARGS__) #define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__) #define LL(...) RD(ll,__VA_ARGS__) #define ST(...) RD(str,__VA_ARGS__) #define UL(n,...) u1 __VA_ARGS__;set_size({n},__VA_ARGS__);li(__VA_ARGS__) #define UV(n,...) u1 __VA_ARGS__;set_size({n},__VA_ARGS__);vi(__VA_ARGS__) #define U2(n,m,...) u2 __VA_ARGS__;set_size({n,m},__VA_ARGS__);li(__VA_ARGS__) #define SS(n,...) strs __VA_ARGS__;set_size({n},__VA_ARGS__);li(__VA_ARGS__) #define I(...) template<__VA_ARGS__> #define J typename #define O operator #define ce constexpr #define cs const #define rr return #define uu using void solve();uu is=std::istream;uu os=std::ostream;uu vo=void;uu bo=bool;uu dd=long double;uu std::cin;uu std::cout; uu std::vector;uu std::map;uu std::set;uu std::multiset;uu std::deque;uu std::priority_queue;I(J T)uu inil=std::initializer_list; uu std::tuple;uu ll=long long;uu i64=ll;uu i128=__int128_t;uu ul=unsigned long long;uu u64=ul;uu u128=__uint128_t; I(J T)uu v1=vector;I(J T)uu v2=v1>;uu u1=v1;uu u2=v2;uu str=std::string;uu strs=v1;str sp=" ",nc="",nl="\n"; uu ml=atcoder::modint998244353;is&O>>(is&i,ml&x){ll t;i>>t;x=t;rr i;}os&O<<(os&o,cs ml&x){rr o<;uu m2=v2; I(J A,J B=A)struct cp{ A a;B b;cp():a(),b(){}cp(A a,B b):a(a),b(b){}cp(std::pairp):a(p.first),b(p.second){}cp O-()cs{rr cp(-a,-b);} cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;} cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}bo O!=(cs cp&c)cs{rr a!=c.a||b!=c.b;} bo O<(cs cp&c)cs{rr a!=c.a?a=(cs cp&c)cs{rr!(*this>(is&i,cp&c){rr i>>c.a>>c.b;} bo O>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}bo O<=(cs cp&c)cs{rr!(*this>c);}friend os&O<<(os&o,cs cp&c){rr o<;uu cls=v1; I(J T)uu qmax=priority_queue;I(J T)uu qmin=priority_queue,std::greater>;uu dl=deque;I(J T)uu uset=std::unordered_set; I(J T)struct mset:multiset{uu multiset::multiset;vo erase(cs T&x){if(this->count(x))multiset::erase(this->find(x));}}; I(J T,J U)uu umap=std::unordered_map;uu mp=map;uu ump=umap;uu sl=set;uu usl=uset;uu msl=mset; I(J T)ce bo is_vec=0;I(J T)ce bo is_vec> =1;I(J T)ce bo is_pq=0;I(J T)ce bo is_pq> =1;I(J T)ce bo is_pq> =1; ce ll oo=3e18;dd ee=1e-12,pi=acosl(-1);u1 dx{-1,0,1,0,-1,1,1,-1},dy{0,-1,0,1,-1,-1,1,1};str Yes(bo y=1){rr y?"Yes":"No";} ul rnd(){static ul x=76,y=53,z=20,w=41;ul t=(x^(x<<11));x=y,y=z,z=w;rr(w=(w^(w>>19))^(t^(t>>8)));}str No(){rr Yes(0);} ll rnd_rng(ll r){rr rnd()%r;}ll rnd_rng(ll l,ll r){rr rnd()%(r-l)+l;}I(J T,J U,J V)bo in(T l,U m,V r){rr l<=m&&m>=1,++r;rr r;}I(J T)T sq(cs T&a){rr a*a;} ll lsb(ll x){rr x?__builtin_ctzll(x):-1;}ll l10(u128 x){x|=1;ll r=0;wh(x)x/=10,++r;rr r;}I(J T)T cb(cs T&a){rr a*a*a;} I(J T)ll len(cs T&a){rr a.size();}I(J T)bo mu(cs T&a){rr !len(a);}I(J T)auto zt(v1a){fo(i,1,len(a))a[i]+=a[i-1];rr a;} I(J T)bo bit(T x,ll i){rr x>>i&1;}I(J T)auto at(cs T&a,ll i){ll n=len(a);rr a[(i%n+n)%n];}u1 io(ll n,ll x=0){u1 a(n);iota(all(a),x);rr a;} I(J T)T flo(T x,T y){rr y<0?x=-x,y=-y:x>=0?x/y:(x+1)/y-1;}I(J T)ll sgn(cs T&a){rr(a>ee)-(a<-ee);} I(J T)T cei(T x,T y){rr y<0?x=-x,y=-y:x<=0?x/y:(x-1)/y+1;}I(J T,J U)ll sgn(cs T&a,cs U&b){rr sgn(a-b);} I(J T)T rect(cs v1&s,ll l,ll r){assert(0<=l&&l<=r&&r<=len(s));T t{};if(r)t+=s[r-1];if(l)t-=s[l-1];rr t;} I(J T)auto&O++(v1&v,int){fe(v,e)++e;rr v;}I(J T)auto&O^=(v1&v,cs v1u){copy(all(u),back_inserter(v));rr v;} I(J T)auto&O--(v1&v,int){fe(v,e)--e;rr v;}I(J T)auto O^(v1v,cs v1&u){rr v^=u;} I(J T)auto&O+=(v1&v,cs v1&u){fo(i,len(v))v[i]+=u[i];rr v;}I(J T)auto O+(v1v,cs v1&u){rr v+=u;} I(J T)auto&O-=(v1&v,cs v1&u){fo(i,len(v))v[i]-=u[i];rr v;}I(J T)auto O-(v1v,cs v1&u){rr v-=u;} I(J T)T&srt(T&a){sort(all(a));rr a;}I(J T)T&rv(T&a){reverse(all(a));rr a;}I(J T)T slice(cs T&a,ll l,ll r){rr T(begin(a)+l,begin(a)+r);} I(J T)T&rsr(T&a){srt(a),rv(a);rr a;}I(J T)T&uq(T&a){srt(a),a.erase(unique(all(a)),end(a));rr a;} I(J T)auto pop(T&a){if ce(is_pq){auto r=a.top();a.pop();rr r;}else{auto r=rb(a);a.pop_back();rr r;}} I(J T)T pof(deque&q){T r=bg(q);q.pop_front();rr r;}I(J T)decltype(auto)bg(T&a){rr*begin(a);} I(J T)T pob(deque&q){T r=rb(q);q.pop_back();rr r;}I(J T)decltype(auto)rb(T&a){rr*rbegin(a);} I(J...A)auto max(cs A&...a){rr std::max(inil>{a...});}I(J T,J U=T)vo af(v1&a,U e={}){a.ep(begin(a),e);} I(J...A)auto min(cs A&...a){rr std::min(inil>{a...});}I(J T)vo df(T&a){a.erase(begin(a));} I(J T,J U)bo amax(T&a,cs U&b){rr a&a,cs U&b){rr lower_bound(all(a),b)-begin(a);} I(J T,J U)bo amin(T&a,cs U&b){rr a>b?a=b,1:0;}I(J T,J U)ll ubs(cs v1&a,cs U&b){rr upper_bound(all(a),b)-begin(a);} I(J V)auto vec_def_val(cs v1&){if ce(is_vec)rr vec_def_val(V());else rr V();}I(J T)bo add(T&a,cs T&b){a+=b;rr 0;} I(J S,bo f(S&,cs S&),J V)cpscan(cs v1&v){//semigroup S r{};bo b=0;if ce(std::is_same_v)fe(v,x)b?f(r,x):(r=x,b=1);else fe(v,x)if(auto[y,c]=scan(x);c)b?f(r,y):(r=y,b=1);rr{r,b};} I(J V,J T=decltype(vec_def_val(V())))T max(cs V&v){rr scan>(v).a;} I(J V,J T=decltype(vec_def_val(V())))T min(cs V&v){rr scan>(v).a;} I(J V,J T=decltype(vec_def_val(V())))T sum(cs V&v){rr scan>(v).a;}I(J F,J...A)vo swl(cs F&f,A&...a){(vo)inil{(vo(f(a)),0)...};} I(J T=ll,ll k=0,ll n)auto mv(cs ll(&s)[n],cs T&x={}){if ce(k==n-1)rr vector(s[k],x);else rr vector(s[k],mv(s,x));} I(ll n,J...A)vo set_size(cs ll(&s)[n],A&...a){swl([&](auto&u){u=mv(s,vec_def_val(u));},a...);} struct fio{fio(){cin.tie(0);std::ios::sync_with_stdio(0);cout<&p){rr o<&v){str s=nl;if ce(is_vec){if ce(is_vec)s+=nl;}else s=sp;fe(v,e)o<&v){fe(v,e)o<&m){fe(m,e)o<&v){fe(v,e)o<>(is&i,v1&v){fe(v,e)i>>e;rr i;} I(J T)ll pp(cs T&a){cout<>...>>a);rr 0;}I(J...A)vo vi(ll i,A&...a){(cin>>...>>a[i]);} I(J T,J...A)ll pp(cs T&a,cs A&...b){cout<&a,A&...b){fo(i,len(a))vi(i,a,b...);} struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};uu graph=v2; graph tog(cs u2&a){graph g;fe(a,e){g.eb();fe(e,v)rb(g).eb(v);}rr g;}cpygi(u2&g,ll m){UV(m,a,b);a--,b--;fo(i,m)g[a[i]].eb(b[i]);rr{a,b};} u2 tou(cs graph&g){u2 a;fe(g,e){a.eb();fe(e,v,w)rb(a).eb(v);}rr a;}cpmgi(u2&g,ll m){auto[a,b]=ygi(g,m);fo(i,m)g[b[i]].eb(a[i]);rr{a,b};} auto ti(u2&g){rr mgi(g,len(g)-1);} u1 en(cs str&s,cs str&b="a"){ll n=len(s);u1 r(n,-1);fo(i,n)if(len(b)==1)r[i]=s[i]-b[0];else fo(j,len(b))if(s[i]==b[j])r[i]=j;rr r;} str de(cs u1&a,cs str&b="a"){ll n=len(a);str r(n,'|');fo(i,n)if(len(b)==1)r[i]=a[i]+b[0];else fo(j,len(b))if(a[i]==j)r[i]=b[j];rr r;} u2 en(cs strs&s,cs str&b="a"){u2 r;fe(s,e)r.eb(en(e,b));rr r;}str ins(){str s;li(s);rr s;}strs inss(ll n){strs s(n);li(s);rr s;} strs de(cs u2&a,cs str&b="a"){ll n=len(a);strs r(n);fo(i,n)r[i]=de(a[i],b);rr r;}u1 abc(){rr en(ins());}u2 abcs(ll n){rr en(inss(n));} I(J F)struct rec:F{rec(F&&f):F(std::forward(f)){}I(J...A)decltype(auto)O()(A&&...a)cs{rr F::O()(*this,std::forward(a)...);}}; I(J...A)u1 zp(A&...a){u1 v;fe({a...},e)v^=e;uq(v);swl([&](u1&u){fe(u,e)e=lbs(v,e);},a...);rr v;} I(J F,J...A)u1 vs(cs F&f,A&...a){ll n;fe({a...},e)n=len(e);u1 o=io(n);sort(all(o),f);swl([&](u1&u){u1 c=u;fo(i,n)u[i]=c[o[i]];},a...);rr o;} I(J F)ll bsl(cs F&f,ll o,ll n){wh(abs(o-n)>1)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}ll sqr(ll x){ll r=max(sqrtl(x)-1,dd());wh(r+1<=x/(r+1))++r;rr r;} I(J F)dd bsd(cs F&f,dd o,dd n){fo(l2(abs(o-n)/ee))(f((o+n)/2)?o:n)=(o+n)/2;rr o;} cls rle(cs u1&a){cls r;fe(a,e)len(r)&&e==rb(r).a?++rb(r).b,0:(r.eb(e,1),0);rr r;}cls rce(u1 a){rr rle(srt(a));} i128 po(i128 x,u128 n,i128 m=0){i128 r=1;wh(n){if(n&1)r*=x;x*=x;if(m)r%=m,x%=m;n>>=1;}rr r;} u1 divs(ll n){u1 r;for(ll i=1;i*i<=n;i++)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r);} cls fact(ll n){ump m;for(ll i=2;i*i<=n;i++)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];cls r;fe(m,e)r.eb(e);rr srt(r);} int main(){ll T=1;li(T);fo(T)solve();} vo solve(){ ll N=3; UL(N,A,X); std::rotate(begin(X),begin(X)+1,end(X)); LL(W); ll ans=0; fo(i,N){ fo(a,A[i]+1){ //A[i+1],A[i+2]を売り切り,A[i]をa個売る ll b=at(A,i+1),c=at(A,i+2); ll x=X[i],y=at(X,i+1),z=at(X,i+2); ll t; //xを売らない if(a>=b&&a>=c&&b+c>=a)amax(ans,(a-b)*y+(a-c)*z+(b+c-a)*W); //yを売らない if(b>=a&&b>=c&&c+a>=b)amax(ans,(b-a)*x+(b-c)*z+(c+a-b)*W); //zを売らない if(c>=a&&c>=b&&a+b>=c)amax(ans,(c-a)*x+(c-b)*y+(a+b-c)*W); //Wをf\in{0,1}個売る fo(f,2){ ll tx=b+c-a-f,ty=c+a-b-f,tz=a+b-c-f; if(tx>=0&&ty>=0&&tz>=0&&eve(tx)&&eve(ty)&&eve(tz)){ amax(ans,tx/2*x+ty/2*y+tz/2*z); } } } } pp(ans); }