#include <iostream>
#include <vector>
using namespace std;
#include <algorithm>
using pii = pair<int, int>;
using ll = long long;
using i128 = __uint128_t;

using ull = unsigned long long;
ll p, a, b;
ll q, c, d;

ll query(ll m, ll t) {
    ll x = min((t - b) / a, m / p);
    // if ((t - b) / a <= m / p) {
    //     return x;
    // }
    // cout << x << '\n';
    if (x <= 0) return 0;
    ll x1 = m / p;
    ll nxt_m_times = ((x1 + 1) * p - m - 1) / ((q - p) * x1) + 1;
    if (nxt_m_times >= 2) {
        // cout << x << " " << nxt_m_times << '\n';

        ll t1 = t - (a * x + b) * nxt_m_times;
        if (t1 < 0) {
            nxt_m_times = t / (a * x + b);
            t1 = t - (a * x + b) * nxt_m_times;
            // ll times = t / (a * x + b);
            // return x * times + query();
        }
        return x * nxt_m_times + query(m + (q - p) * x * nxt_m_times, t1);
    }
    ll t1 = t - (a * x + b);

    return x + query(m + (q - p) * x, t1);
}

void solve() {
    cin >> p >> a >> b;
    cin >> q >> c >> d;
    a += c;
    b += d;
    ll m, t;
    cin >> m >> t;
    cout << m + (q - p) * query(m, t) << '\n';
}

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

    int t;
    cin >> t;
    while (t--) solve();
}

/*
3
5 2 3
8 1 5
14 36
5 2 0
8 1 3
17 6
100 1 0
10000 1 0
99 100000
1
100 0 0
101 1 1
101 4

*/