#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long
typedef int uci;
#define int long long
#define F first
#define S second
typedef complex<double> cd;

seed_seq seq{
    (uint64_t) chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
    (uint64_t) __builtin_ia32_rdtsc(),
    (uint64_t) (uintptr_t) make_unique<char>().get()
};
mt19937 rng(seq);
// mt19937_64 lrng(seq);

struct debugger{
    template <typename T>
    debugger& operator<<(T &a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
    template <typename T>
    debugger& operator<<(T &&a){
        #ifdef DEBUG
            cerr << a;
        #endif
        return *this;
    }
} deb;

const double PI = acos(-1.0);
const int MAX_N = 1e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

//! function insert

//THINK FIRST, CODE SECOND
//DON'T GET STUCK ON ONE STRATEGY
//CALM DOWNNN FOR ONCE IN YOUR LIFE
//REDUCE
//COUGH E??!?!?!! O.O
//uwu i see you ryan

int mods[1000001];
int mult[1000001];
void solve() {
    int a, b, c, d, v, t;
    cin >> a >> b >> c >> d >> v >> t;

    // 100 test cases per file
    // repeats with cycle of length lcm(a, c)
    // maybe, just the number of presses - number of groups

    int total = (t/a + 1) * b + (t/c + 1)*d;
    // now need to determine number of groups of presses

    // for one of the elements, we find the moduli

    if(v >= min(a, c)){
        cout << total-1 << '\n';
        return;
    }
    total -= (t/a+1) + (t/c+1);
    int ind{};
    mods[ind] = 0;
    mult[ind++] = 0;
    int count{};
    if(a < c){
        swap(a, c);
        swap(b, d);
    }
    int amt = c;
    count += amt/a;
    amt %= a;
    while(amt != 0){
        mods[ind] = amt;
        mult[ind++] = count;
        amt += c;
        count += amt/a;
        amt %= a;
    }

    // cycles in (count*a)

    int cyc = count*a;
    for(int i{}; i < ind; ++i){
        // cout << mult[i]*a+mods[i] << ' '<< total << '\n';
        if(mods[i] <= v && t-mult[i]*a-mods[i] >= 0){
            total += ((t-mult[i]*a-mods[i])/cyc + 1);
        }
        if(a-mods[i] <= v && t-mult[i]*a-a >= 0){
            total += ((t-mult[i]*a-a)/cyc + 1);
        }
        // cout << mult[i]*a+mods[i] << ' '<< total << '\n';
    }
    cout << total << '\n';
}

uci main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tc; cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

/*
    random number generator stuff
    num = rng(); gives integer number
    num = uniform_int_distribution<int>(a, b)(rng); -> bounds [a, b]
    num = uniform_real_distribution<double>(a, b)(rng); -> bounds [a, b)
    can also instantiate distributions and call on generator:
    uniform_int_distribution<int> thing(a, b);
    num = thing(rng);
*/
// struct custom_hash {
//     static uint64_t splitmix64(uint64_t x) {
//         // http://xorshift.di.unimi.it/splitmix64.c
//         x += 0x9e3779b97f4a7c15;
//         x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
//         x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
//         return x ^ (x >> 31);
//     }
//     size_t operator()(uint64_t x) const {
//         static const uint64_t FIXED_RANDOM = lrng();
//         return splitmix64(x + FIXED_RANDOM);
//     }
// };