#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define ld long double
#define pb push_back
#define sws cin.tie(0)->sync_with_stdio(false);
#define endl '\n'

using namespace std;

const int N = 2e5+10;
const int MOD = 256;
// const ll MOD = 998244353;
// const ll MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

#define vp vector<point>
#define ld long double
const ld EPS = 1e-6;
const ld PI = acos(-1);

bool isPowerOfTwo(int x) { return x && (!(x&(x-1))); }
int flog2(int x) { return 32-1-__builtin_clz(x); }

int32_t main()
{
    #ifndef LOCAL
    sws;
    #endif

    int t; cin >> t;
    while (t--) {
        ll a, b, c, d; cin >> a >> b >> c >> d;
        ll v, t; cin >> v >> t;
        ll l = lcm(a, c);

        vector<pair<ll, ll>> values;
        ll x = a;
        while (x < l) {
            values.push_back({x, b});
            x += a;
        }
        x = c;
        while (x < l) {
            values.push_back({x, d});
            x += c;
        }
        values.push_back({0, b+d});
        sort(values.begin(), values.end());
        int sz = values.size();
        vector<ll> psum(sz, 0);

        for (int i=0;i<sz;i++) {
            auto [value, cost] = values[i];
            if (i == 0) psum[i] = cost - 1;
            else {
                psum[i] = psum[i-1] + cost - 1;
                if (value - values[i-1].ff <= v) { // checar se é menor ou menor igual
                    psum[i] ++;
                }
            }
        }

        ll cycle_cost = psum[sz-1];


        // for (int i=0;i<sz;i++) {
        //     cout << values[i].ff << " " << values[i].ss << " " << psum[i] << endl;
        // }
        // cout << endl;
        ll ans = 0;

        ll qnt_voltas = t / l;
        ll chorinho = t % l;

        // cout << qnt_voltas << " " << chorinho << endl;
        if (qnt_voltas >= 1) {
            qnt_voltas --;
            ans += cycle_cost;
            if (l - values[sz-1].ff <= v) {
                cycle_cost ++;
                for (int i=0;i<sz;i++) psum[i] ++;
            }
        }
        ans += qnt_voltas * cycle_cost;

        int id = upper_bound(values.begin(), values.end(), pair<ll, ll>({chorinho, LLINF})) - values.begin() - 1;
        ans += psum[id];

        cout << ans << endl;
    }

    return 0;
}