#include<bits/stdc++.h>

#define f first
#define s second
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()

using namespace std;

vector<ll> x(6);
vector<int> n(2),k(6);
ll ans;
void pok(){
    x[0]=(n[0]-x[5]*k[5])/k[0];
    if(x[0]<0)return;
    x[1]=x[0]*k[0]+x[5]*k[5]-x[4];
    if(x[1]<0)return;
    x[2]=(n[1]-x[4]*k[4])/k[2];
    if(x[2]<0)return;
    x[3]=x[2]*k[2]+x[4]*k[4]-x[5];
    if(x[3]<0)return;
    if(x[0]==0&&x[2]==0)return;
    if(x[1]+x[4]>n[0])return;
    if(x[3]+x[5]>n[1])return;
    ans=max(ans,x[1]*k[1]+x[3]*k[3]-x[0]-x[2]);
}
void test(){
    for(int i=0;i<2;i++){
        scanf("%i",&n[i]);
    }
    for(int i=0;i<6;i++){
        scanf("%i",&k[i]);
    }
    ans=0;
    for(x[4]=0;x[4]<=100;x[4]++){
        for(x[5]=0;x[5]<=100;x[5]++){
            pok();
        }
    }
    int mx4=min(n[1]/k[4],n[0]),mx5=min(n[0]/k[5],n[1]);
    for(x[4]=mx4;x[4]>=0&&mx4-x[4]<=100;x[4]--){
        for(x[5]=mx5;x[5]>=0&&mx5-x[5]<=100;x[5]--){
            pok();
        }
    }
    printf("%lld\n",ans+1);
}

int main(){
    int t;
    scanf("%i",&t);
    while(t--){
        test();
    }
}