#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

int test_id = 0 ;

void solve ( ) {
    ll a , b , foo1 , foo2 , v , t ;
    cin >> a >> foo1 >> b >> foo2 >> v >> t ;
    ++ test_id ;
    if ( test_id == 46 ) {
        printf ( "%lld %lld %lld %lld %lld %lld\n" , a , foo1 , b , foo2 , v , t ) ;
    }
    ll tot_a = t / a , tot_b = t / b ;
    ll ans = ( tot_a + 1 ) * foo1 + ( tot_b + 1 ) * foo2 ;
    if ( tot_a + tot_b > 0 ) { -- ans ; }
    if ( min ( a , b ) <= v ) {
        cout << ans << "\n" ;
        return ;
    }
    for ( int ctr = 0 ; ctr < 2 ; ++ ctr ) { 
        ll per = b / __gcd ( a , b ) ;
        ll x = 0 ;
        for ( ll i = 0 ; i < per && i * a <= t ; ++ i ) {
            if ( ctr == 0 || i > 0 ) {
                // printf ( "%lld --> %lld\n" , i , x ) ;
                ll aux = ( tot_a / per ) + ( i <= ( tot_a % per ) ) ;
                // printf ( "aux = %lld, %lld %lld %lld\n" , aux , tot_a , per , i ) ;
                if ( x + v >= b ) { aux = 1 ; }
                ll lst = i * a ;
                lst += ( ( t - lst ) / ( per * a ) ) * ( per * a ) ;
                // printf ( "lst =  %lld\n" , lst ) ;
                if ( ( ( lst / b ) * b + b > t && lst + a > t ) || ( x + v >= b && ( lst / b ) * b + b <= t ) ) { -- aux ; }
                // printf ( "sub %lld\n" , aux ) ;
                ans -= aux ;
            }
            x = ( x + a ) % b ;
        }
        swap ( a , b ) ;
        swap ( tot_a , tot_b ) ;
    }
    // ans += t / ( a * b / __gcd ( a , b ) ) ;
    cout << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}