#include <bits/stdc++.h>
using namespace std;
#define int long long 
#define endl "\n"
const int mod=1e9+7;
void solved(){
    int a,b,c,d,v,t;
    cin>>a>>b>>c>>d>>v>>t;
    int l=a*c/__gcd(a,c);
    auto cal=[&](int mid){
        int x=0;
        int time=-1;
        int t1=0,t2=0;
        while(time<=mid){              
            if(min(t1*a,t2*c)>mid) break;
            if(t1*a==t2*c){
              if(time>=t1*a) x+=b+d;
              else x+=b+d-1;
              time=v+t1*a;
              t1++,t2++;
            }
            else if(t1*a>t2*c){
                if(time>=t2*c) x+=d;
                else x+=d-1;
                time=v+t2*c;
                t2++;
                 }
            else {
                if(time>=t1*a) x+=b;
                else  x+=b-1;
                time=v+a*t1;
                t1++;
            }
        }
        return make_pair(x,(time>=l?1:0));
    };
    if(t<l){
       cout<<cal(t).first<<endl;
    }
    else{
        auto [x,w]=cal(l-1);
        auto [y,v]=cal(t%l);
        cout<<(x+w)*(t/l)+y<<endl;
    }
}
signed main()
{
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   int t=1;
   cin>>t;
   while(t--){
     solved();
   }
}