#include <bits/stdc++.h>
using namespace std;
//typedef long long ll;
using  ll=__int128;

inline string readstring(){
    char ch = getchar();
    string st1 = "";
    while (!((ch >= 'a') && (ch <= 'z')))
        ch = getchar();
    while ((ch >= 'a') && (ch <= 'z'))
        st1 += ch, ch = getchar();
    return st1;
}

inline void writestring(string s) {
    for (int i = 0; i < s.size(); i++) putchar(s[i]);
}

inline int readint(){
    int ans=0,sign=1;
    char ch = getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-'){
            sign=-1;
        }
        ch = getchar();
    }
    while(ch>='0'&&ch<='9'){
        ans = ans*10 + ch-'0';
        ch = getchar();
    }
    return ans*sign;
}

void writeint(int x){
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        writeint(x/10);
    putchar(x%10+'0');
    return;
}

inline ll readll(){
    ll ans=0,sign=1;
    char ch = getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-'){
            sign=-1;
        }
        ch = getchar();
    }
    while(ch>='0'&&ch<='9'){
        ans = ans*(ll)10 + (ll)(ch-'0');
        ch = getchar();
    }
    return ans*sign;
}
void writell(ll x){
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        writell((x/10ll));
    putchar((int)x%10+'0');
    return;
}

inline __int128 readint128(){
    __int128 x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9'){
        if(ch == '-')
            f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){
        x = x * (__int128)10 + (__int128)(ch - '0');
        ch = getchar();
    }
    return x * f;
}

inline void writeint128(__int128 x){
    if(x < 0){
        putchar('-');
        x = -x;
    }
    if(x > 9)
        writeint128((x / (__int128)10));
    putchar(x % 10 + '0');
}

const int N=1000005;
ll mod=(ll)998244353;

ll qmi(ll a,ll b){
    ll res=(ll)1,p=a%mod;
    while (b){
        if(b&(ll)1)res=res*p%mod;
        p=p*p%mod;
        b>>=1;
    }
    return res;
}

//int gcd(int a,int b){
//    return b==0?a:gcd(b,a%b);
//}
ll gcd(ll a,ll b){
    return b==0?a:gcd(b,a%b);
}
int T;
ll a,b,c,d,gc;

void solve(){
a=readint128();b=readint128();
c=readint128();d=readint128();
ll v=readint128();ll t=readint128();
//if(a<c){ swap(a,c);swap(b,d);}
gc=gcd(a,c);
vector<ll>q(a/gc+1),w(c/gc+1);
for(int i=1;i<=(c/gc);i++)w[i]=(w[i-1]+a)%c;
for(int i=1;i<=(a/gc);i++)q[i]=(q[i-1]+c)%a;

vector<ll>sumc(a/gc+1,0),suma(c/gc+1,0);
for(int i=1;i<=(c/gc);i++){
    if(w[i]>a)w[i]=a;
 
    if(w[i]>v)suma[i]=1;suma[i]+=suma[i-1];
}
for(int i=1;i<=(a/gc);i++){
    if(q[i]>c)q[i]=c;
   if(!q[i]){
       q[i]=min(a,c);
    }
    if(q[i]>v)sumc[i]=1;sumc[i]+=sumc[i-1];
}
//    for(ll i:suma)printf("%lld ",i);
//    puts("");
//    for(ll i:sumc)printf("%lld ",i);
//    puts("");




ll lcm=((ll)(a/gc)*(ll)c);
ll e=(ll)(c/gc)*(ll)b+(ll)(a/gc)*(ll)d-(ll)suma[c/gc]-(ll)sumc[a/gc];
ll r=t/lcm,m=t%lcm;
ll ans=((ll)(b+d-(ll)1)+e*r);
ll aa=(m/a),cc=(m/c);
if(aa)ans+=(aa*b-suma[aa]);
if(cc)ans+=(cc*d-sumc[cc]);
writeint128(ans);
puts("");






}

int main() {


    T=(ll)readint();
    //T=1;
    while (T--){
        solve();
    }

    return 0;
}