//#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define N 200005
#define mod 998244353
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define ld long double
#define ls (rt<<1)
#define rs ((rt<<1)|1)
#define SZ(x) (int)(x.size())
#define debug cout<<endl<<"ff"<<endl
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define fi first
#define se second
#define INF 1e9
#define pq priority_queue
#define rep(x,a,b) for(int x=a;x<=b;x++)
int qpow(int a,int b){
	int res=1;
	for(;b;b>>=1){
		if(b&1) res=res*a%mod;
		a=a*a%mod;
	}
	return res;
}
/*int fac[N],ifac[N];
int C(int n,int m){
	if(m>n||m<0||n<0) return 0;
	return fac[n]*ifac[n-m]%mod*ifac[m]%mod;
}
void init(){
	fac[0]=1;
	for(int i=1;i<N;i++) fac[i]=fac[i-1]*i%mod;
	ifac[N-1]=qpow(fac[N-1],mod-2);
	for(int i=N-2;i>=0;i--) ifac[i]=ifac[i+1]*(i+1)%mod;
}*/
/*struct node{
	int nxt,to;
}e[N<<1];
int cnt=1,head[N];
inline void add(int x,int y){
	e[++cnt].nxt=head[x];
	head[x]=cnt;
	e[cnt].to=y;
}*/
inline int lowbit(int x){return x&(-x);}
inline int read(){
  int x=0,t=1;char ch=getchar();
  while(ch<'0'||ch>'9'){
    if(ch=='-') t=-1;
    ch=getchar();
  }
    while(ch>='0'&&ch<='9'){
        x=(x<<1)+(x<<3)+(ch-'0');
        ch=getchar();
    }
    return x*t;
}
inline void write(int x){
	if(x<0) putchar('-'),x=-x;
	if(x>=10) write(x/10);
	putchar(x%10+'0');
}
int T,n,A,B,C,D,v,tot;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>T;
	while(T--){
		cin>>A>>B>>C>>D>>v>>tot;
		//[0,t]，关键点是A的倍数，C的倍数，有多少个 关键点-上一个关键点>v 
		int ans=(tot/A+1)*B+(tot/C+1)*D;
		int t=A*C/__gcd(A,C),sum=0;
		//A*(1~t/A-1)这些关键点,ans单独减去最后一个循环的
		int lim=tot%t;//[0,lim] 
		for(int i=1;i<t/A;i++){
			int now=i*A;
			int lst=max(now-A,now/C*C);
			if(now-lst<=v) continue;
			if(now<=lim) ans--;
			sum++;
		}
		for(int i=1;i<t/C;i++){
			int now=i*C;
			int lst=max(now-C,now/A*A);
			if(now-lst<=v) continue;
			if(now<=lim) ans--;
			sum++;
		}ans--;ans-=sum*(tot/t);
		if(min(A,C)>v) ans-=(tot/t);
		cout<<ans<<'\n';
	}
	return 0;
}