#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000010;
ll a, b, c, d, v, t, ans;
ll rem[N]; int len;
int pos[N];

ll dis(ll x) {
    ll w1 = ((x - 1) / a) * a, w2 = ((x - 1) / c) * c;
    // cout << ">>> dis : " << x << " " << x - max(w1, w2) << "\n";
    return x - max(w1, w2);
}
ll calc(ll x, int tt) {
    ll res = 0, cnt = 0;
    for(int i = 0; i <= x; i++) pos[i] = 0;
    rem[len = 1] = dis(x), pos[rem[len]] = len;
    for(int i = 2; i <= tt; i++) {
        ll w = 1ll * x * i, dd = dis(w);
        rem[++len] = dd, pos[dd] = len;
    }
    // for(int i = 1; i <= len; i++) cout << rem[i] << " ";
    ll step = t / x;
    for(int i = 1; i <= len; i++)
        if(rem[i] > v) ++cnt;
    res += (step / len) * cnt;
    step %= len;
    for(int i = 1; i <=step; i++)
        if(rem[i] > v) ++res;
    // cout << ">>> calc : " << x << " " << res << "\n";
    return res;
}
void solve() {
    cin >> a >> b >> c >> d >> v >> t;
    ans = b + d - 1 + b * (t / a) + d * (t / c);
    if(a <= v || c <= v) {
        cout << ans << "\n";
        return ;
    }
    ll d = __gcd(a, c);
    ans = ans - calc(a, c / d) - calc(c, a / d) + (t / (a * c / d));
    cout << ans << "\n";
}
int main() {
    ios::sync_with_stdio(0); cin.tie(nullptr);
    int T; cin >> T;
    for(; T; --T) solve();
    return 0;
}
/*
1
5 4 7 3 3 30

*/