#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return a + b; } val e() { return 0; } val mp(func f, val a) { if (f == -1) return a; return f; } func comp(func f, func g) { if (f == -1) return g; return f; } func id() { return -1; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; ll z; bool f(ll v) { return v < z; } int main() { ll t; cin >> t; while (t--) { VL c = read(3); VL p = read(4); ll ans = 0; REP(i, 3) { // とりあえず全部買うので固定するもの REP(j, c[i] + 1) { ll tmp = 0; VL cc = c; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; tmp += j * p[i]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[(i + 0) % 3]; cc[(i + 2) % 3] -= z; cc[(i + 0) % 3] -= z; tmp += z * p[(i + 2) % 3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[(i + 1) % 3], cc[(i + 2) % 3]) * p[(i + 1) % 3]; TOMAX(ans, tmp); } REP(j, c[i]) { ll tmp = p[3]; VL cc = c; cc[0]--; cc[1]--; cc[2]--; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; tmp += j * p[i]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[(i + 0) % 3]; cc[(i + 2) % 3] -= z; cc[(i + 0) % 3] -= z; tmp += z * p[(i + 2) % 3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[(i + 1) % 3], cc[(i + 2) % 3]) * p[(i + 1) % 3]; TOMAX(ans, tmp); } } REP(k, 3) { // 全部買う奴その1＋これを買わない奴は0or1 REP(i, 3) { // 全部買う奴その2 if (i == k) continue; REP(j, c[i] + 1) { ll tmp = 0; VL cc = c; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; cc[(i + 2) % 3] -= j; tmp += j * p[3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[k]; cc[i] -= z; cc[k] -= z; ll kk = abs(i - k) > 1 ? 2 : min(i, k); ll jj = 3 ^ i ^ k; ll jk = abs(i - jj) > 1 ? 2 : min(i, jj); tmp += z * p[kk]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[i], cc[jj]) * p[jk]; TOMAX(ans, tmp); } REP(j, c[i] + 1) { ll jj = 3 ^ i ^ k; ll tmp = p[jj]; VL cc = c; cc[(i + 2) % 3] -= 1; cc[(i + 1) % 3] -= 1; cc[(i + 0) % 3] -= j; cc[(i + 1) % 3] -= j; cc[(i + 2) % 3] -= j; tmp += j * p[3]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; ll z = cc[k]; cc[i] -= z; cc[k] -= z; ll kk = abs(i - k) > 1 ? 2 : min(i, k); ll jk = abs(i - jj) > 1 ? 2 : min(i, jj); tmp += z * p[kk]; if (cc[0] < 0 || cc[1] < 0 || cc[2] < 0) continue; tmp += min(cc[i], cc[jj]) * p[jk]; TOMAX(ans, tmp); } } } cout << ans << "\n"; } return 0; }