#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
pair<lld,lld> mon[3];
const int MX=105;
const int MX2=205;
lld DP[MX][MX2][MX2];
const lld INF=1e18;
void solve(){
	rep(i,0,3)cin>>mon[i].first;
    rep(i,0,3)cin>>mon[i].second;
    sort(mon,mon+3);
    rep(i,0,MX){
        rep(j,0,MX2){
            rep(k,0,MX2)DP[i][j][k]=INF;
        }
    }
    DP[0][0][0]=0;
    rep(i,0,MX-1){
        rep(j,0,MX2){
            rep(k,0,MX2){
                lld atk=0;
                if(j<mon[0].first)atk+=mon[0].second;
                if(k<mon[1].first)atk+=mon[1].second;
                if(mon[2].first>(i*(i+1))/2-j-k)atk+=mon[2].second;
                if(j<mon[0].first)DP[i+1][j+i+1][k]=min(DP[i+1][j+i+1][k],DP[i][j][k]+atk);
                if(k<mon[1].first)DP[i+1][j][k+i+1]=min(DP[i+1][j][k+i+1],DP[i][j][k]+atk);
                DP[i+1][j][k]=min(DP[i+1][j][k],DP[i][j][k]+atk);
            }
        }
    }
    //~ rep(j,0,10){
        //~ rep(k,0,10){
            //~ cout<<DP[3][j][k]<<" ";
        //~ }cout<<"\n";
    //~ }
    lld ans=INF*2;
    rep(j,0,MX2){
        rep(k,0,MX2){
            lld rem=(MX*(MX-1))/2-j-k;
            rem=mon[2].first-rem;
            lld lo=MX-2;
            lld hi=1e9;
            hi*=3;
            hi/=2;
            while(hi-lo>1){
                lld mid=(hi+lo)/2;
                if((mid*(mid+1))/2-(MX*(MX-1))/2>=rem)hi=mid;
                else lo=mid;
            }
            if(j<mon[0].first && k<mon[1].first){
                ans=min(ans,DP[MX-1][j][k]+(hi-MX+1)*(mon[2].second+mon[1].second+mon[0].second)+mon[0].second+mon[1].second+min(mon[0].second,mon[1].second));
            }else{
                if(j<mon[0].first){
                    ans=min(ans,DP[MX-1][j][k]+(hi-MX+1)*(mon[2].second+mon[0].second)+mon[0].second);
                }else{
                    if(k<mon[1].first){
                        ans=min(ans,DP[MX-1][j][k]+(hi-MX+1)*(mon[2].second+mon[1].second)+mon[1].second);
                    }else{
                        ans=min(ans,DP[MX-1][j][k]+(hi-MX+1)*mon[2].second);
                    }
                }
            }
        }
    }
    cout<<ans<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	cin>>tt;
	while(tt--){
		solve();
	}
}