/*
    author:  Maksim1744
    created: 02.09.2023 13:27:53
*/

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T> &v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T> &v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> pair<T,U>& operator--           (pair<T, U> &p){--p.first; --p.second;            return  p;}
template<typename T, typename U> pair<T,U>& operator++           (pair<T, U> &p){++p.first; ++p.second;            return  p;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U> &p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>  p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define SHOW_COLORS
#include "/mnt/c/Libs/tools/print.cpp"
#else
#define show(...) void(0)
#define debugf(fun)   fun
#define debugv(var)   var
#define mclock    void(0)
#define shows     void(0)
#define debug  if (false)
#define OSTREAM(...)    ;
#define OSTREAM0(...)   ;
#endif

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd (ll l, ll r) { return (ll)(rng() % (r - l + 1)) + l; }
ll rnd (ll r)       { return rng() % r; }
ll rnd ()           { return rng(); }
ld rndf()           { return (ld)rng() / (ld)ULLONG_MAX; }
ld rndf(ld l, ld r) { return rndf() * (r - l) + l; }

void test_case(int test) {
    ll a, x, b, y, v, t;
    cin >> a >> x >> b >> y >> v >> t;
    ll tot = 0;
    tot += (t / a + 1) * x;
    tot += (t / b + 1) * y;

    auto calc = [](ll a, ll b, ll v, ll t) -> ll {
        if (a < b) swap(a, b);
        if (b <= v) return 0;
        if (a == b) {
            ll norm = t / a;
            return norm;
        }

        ll res = 0;
        ll lc = lcm(a, b);
        if (t >= lc) {
            ll cur = 0;
            for (ll i = 0; i < lc / a; ++i) {
                ll on_seg = a * (i + 1) / b - a * i / b - (i != 0);
                cur += on_seg;
                if (i) {
                    ll left = a * i % b;
                    ll right = b - left;
                    assert(left != 0);
                    assert(right != 0);
                    if (left > v) ++cur;
                    if (right > v) ++cur;
                }
            }
            show(cur);
            res += t / lc * cur;
            t %= lc;
        }
        show(res);
        show(t);

        for (ll i = 0; i < lc / a; ++i) {
            ll on_seg = max(0ll, min(t / b, a * (i + 1) / b) - min(t / b, a * i / b) - (i != 0));
            res += on_seg;
            if (i) {
                ll left = a * i % b;
                ll right = b - left;
                assert(left != 0);
                assert(right != 0);
                if (a * i <= t && left > v) ++res;
                if (a * i + right <= t && right > v) ++res;
            }
        }

        show(res);

        // {
        //     ll last = min(t % a, t % b);
        //     res += (last > v);
        // }

        return res;
    };

    // for (int i = 0; i < 100000; ++i) {
    //     auto easy = [&](ll a, ll b, ll v, ll t) {
    //         vector<ll> pts = {0};
    //         for (ll u = 0; u <= t; u += a)
    //             pts.pb(u);
    //         for (ll u = 0; u <= t; u += b)
    //             pts.pb(u);
    //         sort(pts.begin(), pts.end());
    //         pts.erase(unique(pts.begin(), pts.end()), pts.end());
    //         ll res = 0;
    //         for (int i = 0; i + 1 < pts.size(); ++i)
    //             if (pts[i + 1] - pts[i] > v)
    //                 ++res;
    //         return res;
    //     };

    //     ll a = rnd(1, 1000);
    //     ll b = rnd(1, 1000);
    //     ll v = rnd(1, 1000);
    //     ll t = rnd(1, 1000);
    //     ll ans = easy(a, b, v, t);
    //     ll out = calc(a, b, v, t);
    //     if (out != ans) {
    //         show(a, b, v, t);
    //         show(out, ans);
    //         assert(false);
    //     }
    // }

    ll cc = calc(a, b, v, t);
    show(a, b, v, t);
    show(tot, cc);
    cout << tot - 1 - cc << '\n';
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int T;
    cin >> T;
    for (int test = 1; test <= T; ++test) {
        test_case(test);
    }

    return 0;
}