// #define _GLIBCXX_DEBUG // for STL debug (optional) #include #include #include #include #include #include #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 int; using int64 = long long int; template void chmax(T &a, T b) {a = max(a, b);} template void chmin(T &a, T b) {a = min(a, b);} template void chadd(T &a, T b) {a = a + b;} int dx[] = {0, 0, 1, -1}; int dy[] = {1, -1, 0, 0}; const int INF = 1LL << 29; const ll LONGINF = 1LL << 60; const ll MOD = 1000000007LL; void solve() { ll a, b, c, x, y, z; cin >> a >> b >> c >> x >> y >> z; ll res = LONGINF; // 真ん中を最も高く { ll A = a, B = b, C = c, ans = 0; { ll diff = max({A, B - 1, C}) - (B - 1); ans += diff * z; A -= diff, C -= diff; } if(A == C) { if(A + 1 < B) { if(x > y) { ans += y; B -= 1, C -= 1; } else { ans += x; A -= 1, B -= 1; } } else { // B, C if(x > y) { ans += y + z; A -= 1, B -= 1, C -= 2; } // A, B else { ans += x + z; A -= 2, B -= 1, C -= 1; } } } bool ok = true; ok &= (A > 0 and B > 0 and C > 0); ok &= (A != B); ok &= (B != C); ok &= (C != A); if(ok) chmin(res, ans); fprintf(stderr, "A = %lld, B = %lld, C = %lld\n", A, B, C); } // 真ん中を最も低く { ll A = a, B = b, C = c, ans = 0; if(A == C) { if(x > y) { ans += y; B -= 1, C -= 1; } else { ans += x; A -= 1, B -= 1; } } ll target = min(min(A, C) - 1, B); ans += (B - target) * (x + y); A -= (B - target); C -= (B - target); B -= (B - target) * 2; bool ok = true; ok &= (A > 0 and B > 0 and C > 0); ok &= (A != B); ok &= (B != C); ok &= (C != A); if(ok) chmin(res, ans); } cout << (res == LONGINF ? -1 : res) << endl; } int main() { int T; cin >> T; while(T--) solve(); return 0; }