#include <bits/stdc++.h>
using namespace std; 
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll,ll>;
using vpll = vector<pll>;
using vb = vector<bool>;
using vs = vector<string>; //
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const ld eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c),end(c)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define xx first
#define yy second
#define FOR(i,a,b) for (ll i=(a); i<(b); i++)
#define FORD(i,a,b) for (ll i=ll(b)-1; i>=(a); i--)
#define TR(X) ({ if(1) cerr << "TR: " << (#X) << " = " << (X) << endl; })

void solve(){
    ll a, b, c, d, v, t;
    cin >> a >> b >> c >> d >> v >> t;

    ll zeros = 0, cnt = 0;
    ll cur = 0;
    ll na = a, nc = c;
    while (cur < a * c){
        ll next = min(na, nc);
        if(cur <= t % (a * c) && next > t % (a * c))
            zeros = cnt;
        if(next - cur > v)
            cnt++;
        cur = next;
        if(cur >= na)
            na += a;
        if(cur >= nc)
            nc += c;
    }
    zeros += (t / (a * c)) * cnt;
    ll ans = (1 + t / a) * b + (1 + t / c) * d - zeros;
    cout << ans - 1 << "\n";
}

int main() { 
    cin.sync_with_stdio(0);
    cin.tie(0);
    
    ll tc; cin >> tc;
    while (tc--)
    	solve();
}