#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
//const long long MOD = 1000000007LL;
const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;

ll solve(ll x, ll y, ll z, ll X, ll Y, ll Z) {
	ll res = 0;
	if (y <= z) {
		if (y == 1) return INF;
		res += (z - (y - 1)) * Z;
		ll su = z - (y - 1);
		z = y - 1;
		x -= su;
		if (x <= 0) return INF;
	}
	if (x <= y) {
		if (x == 1) return INF;
		res += (y - (x - 1)) * Y;
		ll su = y - (x - 1);
		y = x - 1;
		z -= su;
		if (z <= 0) return INF;
	}

	return res;
}
int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll t; scanf("%lld", &t);
	while (t--) {
		ll A, B, C, X, Y, Z;
		ll res = INF;
		scanf("%lld %lld %lld %lld %lld %lld", &A, &B, &C, &X, &Y, &Z);
		// B -> Z , A->Y, C -> X
		chmin(res, solve(B, A, C, Z, Y, X));
		chmin(res, solve(B, C, A, Z, X, Y));
		chmin(res, solve(A, C, B, Y, X, Z));
		chmin(res, solve(C, A, B, X, Y, X));

		if (res == INF) res = -1;
		printf("%lld\n", res);
	}
	return 0;
}