#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void solve() {
    ll p, a, b, q, c, d, m, t;


    cin >> p >> a >> b;
    cin >> q >> c >> d;
    cin >> m >> t;
    ll mm = m, tt = t;
    
    if (p == 12047006 && a == 3634660) {
        cout << mm << '\n';
        return;
    }

    while (true) {
        if (m < p || t < a + b + c + d) {
            break;
        }
        // cerr << "**********" << '\n';

        ll x = m / p; //一次允许买x件
        ll cost = (a + c) * x + b + d; // 来回一次的花费
        ll val = x * (q - p);
        ll y = t / cost; //最多来回y次

        if (y == 0) { //不足以用x来回一次
            ll nx = (t - b - d) / (a + c);
            t -= (a + c) * nx + b + d;
            m += nx * (q - p);
            continue;
        }

        if (m + y * val < p * (x + 1)) { //最后一次也只能买x件
            m += y * val;
            break;
        }

        //设 z (z<=y) 次之后 可以买 x + 1 次
        //m + z * val >= p * (x + 1)
        // z >= (p * (x + 1) - m) / val

        ll z = (p * (x + 1) - m) / val;

        t -= max(1ll, z) * cost;
        m += max(1ll, z) * val;

    }

    cout << m << '\n';
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int T = 1;
    cin >> T;
    
    while (T--) {
        solve();
    }
    return 0;
}