#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// #define int long long
#define endl '\n'
#define all(_x) _x.begin(), _x.end()
#define range(_x, _st, _ed) (_x.begin() + _st), (_x.begin() + _ed)
#define rep(_x, _y, _z) for (int _x = _y; _x <= _z; _x++)
#define matrix(_x, _y, _z) vector<vector<int>>(_x, vector<int>(_y, _z))
#define debug(_x) cout << #_x << '=' << _x << endl
using i64 = long long;
using i128 = __int128;
using pii = pair<int, int>;
using mat = vector<vector<int>>;
using u64 = unsigned long long;
constexpr int N = 2e5 + 10;
// dont use umap!!!

void solve()
{
    i64 p, a, b;
    cin >> p >> a >> b;
    i64 q, c, d;
    cin >> q >> c >> d;
    i64 m, t;
    cin >> m >> t;
    while(t > b + d)
    {
        i64 x = m / p;
        if(x == 0) break;
        i64 L = (p * (x + 1) - m + (q - p) * x - 1) / ((q - p) * x);
        L = min(L, t / ((a + c) * x + b + d));
        if(L == 0)
        {
            L = 1;
            x = (t - b - d) / (a + c);
        }
        if(x == 0) break;
        m += L * (q - p) * x;
        t -= L * ((a + c) * x + b + d);
    }
    cout << m << '\n';
}

signed main()
{
    IOS;
    int _ = 1;
    cin >> _;

    while (_--) solve();

    return 0;
}