#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}
 
ll a, b, c, d, v, t;
 
void solve()
{
    cin >> a >> b >> c >> d >> v >> t;

    vector<pair<ll, int>> pos;
    ll lcm = a * c / __gcd(a, c);

    ll x = 0;
    ll y = 0;
    while(true) {
        if(x > lcm && y > lcm) break;
        if(x <= lcm) pos.pb(make_pair(x, 0));
        if(y <= lcm) pos.pb(make_pair(y, 1));
        x += a;
        y += c;
    }

    ll res = 0;
    sort(all(pos));
    for(int i = 0; i < sz(pos); i++) {
        if(pos[i].fi > t) break;
        if(i == 0) res += b - 1;
        else {
            if(pos[i - 1].fi + v >= pos[i].fi) res += (pos[i].se == 0 ? b : d);
            else res += (pos[i].se == 0 ? b - 1 : d - 1);
        }
    }


    if(t <= lcm) {
        cout << res << endl;
    }
    else {
        int cnt = (t / lcm);
        res = res * cnt;
        res -= 1LL * cnt * (b + d - 1);


        int temp = t % lcm;
        for(int i = 0; i < sz(pos); i++) {
            if(pos[i].fi > temp) break;
            if(i == 0) res += b - 1;
            else {
                if(pos[i - 1].fi + v >= pos[i].fi) res += (pos[i].se == 0 ? b : d);
                else res += (pos[i].se == 0 ? b - 1 : d - 1);
            }
        }
        cout << res << endl;
    }
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // freopen(TASK".inp" , "r" , stdin);
    // freopen(TASK".out" , "w" , stdout);
 
    int tc = 1;
    cin >> tc;
    while(tc--) {
        solve();
    }
    return 0;
}