#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
constexpr int mod = 998244353;
constexpr int N = 1e6 + 10;

void solve() {
    ll p, a, b, q, c, d, m, t;
    cin >> p >> a >> b >> q >> c >> d >> m >> t;
    ll x = min(m / p, (t - b - d) / (a + c));
    while (x > 0) {

        ll det = (q - p) * x, k;
        if (p * (x + 1) > m)k = (p * (x + 1) - m + det - 1) / det;
        else {
            m += det;
            break;
        }
        ll cost = (a + c) * x + (b + d);
        k = min(k, t / cost);
        m += k * det;
        t -= k * cost;
        if (t < b + d) break;
        x = min(m / p, (t - b - d) / (a + c));
    }
    cout << m << "\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int tt = 1;
    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}