import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum INF = 10L^^18; void main() { try { for (; ; ) { const numCases = readInt(); foreach (caseId; 0 .. numCases) { const A = readLong(); const B = readLong(); const C = readLong(); const X = readLong(); const Y = readLong(); const Z = readLong(); long[] xs; foreach (x; A - 4 .. A + 4 + 1) if (x > 0) xs ~= x; foreach (x; B - 4 .. B + 4 + 1) if (x > 0) xs ~= x; foreach (x; C - 4 .. C + 4 + 1) if (x > 0) xs ~= x; xs = xs.sort.uniq.array; const xsLen = cast(int)(xs.length); debug { writeln("xs = ", xs); } long ans = INF; void check(int i, int j, int k) { if (i != k) { if (xs[i] >= A && xs[j] >= B && xs[k] >= C) { const a = xs[i] - A; const b = xs[j] - B; const c = xs[k] - C; if (xs[i] - b - c > 0 && xs[j] - c - a > 0 && xs[k] - a - b > 0) { chmin(ans, Y * a + Z * b + X * c); } } } } foreach (j; 0 .. xsLen) { // center min foreach (i; j + 1 .. xsLen) foreach (k; j + 1 .. xsLen) { check(i, j, k); } // center max foreach (i; 0 .. j) foreach (k; 0 .. j) { check(i, j, k); } } writeln((ans >= INF) ? -1 : ans); } } } catch (EOFException e) { } }