#include<bits/stdc++.h>

using namespace std;

#define int long long
using i128 = __int128;
int n, k;
const int mod = 998244353;
int p, a, b, q, c, d, m, t;

void solve(){
    cin >> p >> a >> b;
    cin >> q >> c >> d;
    cin >> m >> t;
    a += c, b += d;
    while(1) {
        int i = min(m / p, (t - b) / a);
        if(i <= 0) break;
        int tmaxc = t / (a * i + b);
        int gain = tmaxc * i * (q - p);
        if(m + gain >= p * (i + 1)) {
            int nd = p * (i + 1) - m;
            int ndx = (nd + (q - p) - 1) / (q - p);
            int ndc = (ndx + i - 1) / i;
            int ndt = a * ndc * i + b * ndc;
         //   cout << i << ' ' << nd << ' ' << ndx << ' ' << ndc << ' ' << ndt << ' ';
            t -= ndt;
            m += ndc * (q - p) * i;
       //     cout << t << ' ' << m << endl;
        } else {
            m += gain;
            break;
        }
    }
    cout << m << '\n';
}

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