def midfind(midlst):
    global maxt
    global mint
    midt = 0
    if midlst.count(maxt) == 2:
        midt = maxt
    else:
        midt = mint
    return midt

def minans(anslst):
    ans = 10 ** 9
    ans = min(ans, 2 * anslst[0] + anslst[-1])
    ans = min(ans, 2 * anslst[-1] + anslst[0])
    ans = min(ans, 2 * anslst[1] + anslst[0])
    ans = min(ans, 2 * anslst[1] + anslst[-1])
    return ans

T = int(input())
abclst = [list(map(int, input().split())) for _ in range(T)]

for i in range(T):
    maxt = max(abclst[i][:3])
    mint = min(abclst[i][:3])
    midt = 0
    ans = 10 ** 9
    if abclst[i][0:3].count(abclst[i][0]) == 3:
        if abclst[i][0] >= 3:
            tmplist = abclst[i][3:]
            tmplist.sort()
            ans = minans(abclst[i][3:])
            print(ans)
        else:
            print(-1)
        continue

    for j in range(3):
        if abclst[i][j] != maxt and abclst[i][j] != mint:
            midt = abclst[i][j]
            if j == 0 or j == 2:
                ans = 0
            break
    if midt == 0:
        midt = midfind(abclst[i][:3])
    if ans == 0:
        print(ans)
    else:
        tmp1 = maxt - midt + 1
        if maxt - tmp1 == mint:
            tmp1 += 1
        if maxt - tmp1 > 0:
            ans = tmp1 * abclst[i][3]
        tmp2 = midt - mint + 1
        if midt - tmp2 > 0:
            ans = min(ans, tmp2 * abclst[i][4])
        if ans == 10 ** 9:
            print(-1)
        else:
            print(ans)