#include using namespace std; using lint = long long int; using pint = pair; using plint = pair; struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; #define ALL(x) (x).begin(), (x).end() #define SZ(x) ((lint)(x).size()) #define POW2(n) (1LL << (n)) #define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i=i##_begin_;i--) #define REP(i, n) FOR(i,0,n) #define IREP(i, n) IFOR(i,0,n) template void ndarray(vector &vec, int len) { vec.resize(len); } template void ndarray(vector &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); } template bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; } template bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; } template pair operator+(const pair &l, const pair &r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair &l, const pair &r) { return make_pair(l.first - r.first, l.second - r.second); } template istream &operator>>(istream &is, vector &vec){ for (auto &v : vec) is >> v; return is; } ///// This part below is only for debug, not used ///// template ostream &operator<<(ostream &os, const vector &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const deque &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const set &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_set &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const multiset &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_multiset &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const pair &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; } template ostream &operator<<(ostream &os, const map &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_map &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl; ///// END ///// /* #include #include #include using namespace __gnu_pbds; // find_by_order(), order_of_key() template using pbds_set = tree, rb_tree_tag, tree_order_statistics_node_update>; template using pbds_map = tree, rb_tree_tag, tree_order_statistics_node_update>; */ constexpr lint INF = 4e18; lint dfs(lint A, lint B, lint C, lint X, lint Y, lint Z, int depth) { lint ret = INF; if (A <= 0 or B <= 0 or C <= 0) return INF; if (A != B and B != C and C != A) return 0; if (depth == 0) return INF; mmin(ret, X + dfs(A - 1, B - 1, C, X, Y, Z, depth - 1)); mmin(ret, Y + dfs(A, B - 1, C - 1, X, Y, Z, depth - 1)); mmin(ret, Z + dfs(A - 1, B, C - 1, X, Y, Z, depth - 1)); return ret; } lint solve1(lint A, lint B, lint C, lint X, lint Y, lint Z) { // a < b > c にする lint sub = max({A - B + 1, C - B + 1, 0LL}); lint cost = sub * Z; A -= sub; C -= sub; return dfs(A, B, C, X, Y, Z, 3) + cost; } lint solve2(lint A, lint B, lint C, lint X, lint Y, lint Z) { // a > b < c にする lint cost = 0; lint suby = max(B - A + 1, 0LL); B -= suby, C -= suby; cost += suby * Y; lint subx = max(B - C + 1, 0LL); A -= subx, C -= subx; cost += subx * X; return dfs(A, B, C, X, Y, Z, 3) + cost; } int main() { int T; cin >> T; while (T--) { lint A, B, C, X, Y, Z; cin >> A >> B >> C >> X >> Y >> Z; lint ret = min(solve1(A, B, C, X, Y, Z), solve2(A, B, C, X, Y, Z)); cout << (ret <= INF / 2 ? ret : -1) << endl; } }