// Problem: J - Press the Button
// Contest: Virtual Judge - The 2nd Universal Cup. Stage 1: Qingdao
// URL: https://vjudge.net/contest/583075#problem/J
// Memory Limit: 253 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define gc getchar
#define itn int
#define x first
#define y second
#define eb emplace_back
#define em emplace
#define pb push_back
#define db double
#define y1 yy1_yyds
using namespace std; typedef long long ll; typedef unsigned long long ull;
// https://www.luogu.com.cn/discuss/522581 About "const"
ll read() {
	ll x = 0; short fh = 1; char ch = gc();
	while (!isdigit(ch)) {
		if (ch == '-') fh = -1;
		if (ch < 10) exit(0); 
		ch = gc();
	}
	while (isdigit(ch))
		x = x * 10 + (ch ^ 48), ch = gc();
	return fh * x;
}
#ifndef ONLINE_JUDGE
void debug() {cerr << "\n";}
template<typename Typ1> void debug(Typ1 arg) {cerr << arg << "\n";}
template<typename Typ1, typename ...Typ2> void debug(Typ1 arg, Typ2 ...args) {
	cerr << arg << " ", debug(args...);
}
#else
void debug() {}
template<typename Typ1> void debug(Typ1 arg) {}
template<typename Typ1, typename ...Typ2> void debug(Typ1 arg, Typ2 ...args) {}
#endif
void writeln(ll arg) {printf("%lld\n", arg);}
template<typename ...Typ2> void writeln(ll arg, Typ2 ...args) {
	printf("%lld ", arg), writeln(args...);
}
typedef pair <int, int> pii; typedef pair <ll, ll> pll;
const char Y_E_S[] = "YES", N__O[] = "NO";
// const char Y_E_S[] = "Yes", N__O[] = "No";
// #define infinite_testcase
#define multiple_testcase
// #define output_Yes_No
const int DUST = 327, N = 1145810, M = -1;
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
ll solve(ll a, ll b, /**/ll last, ll v, ll t) {//复杂度：lcm / a + lcm / b <= a + b
	ll c = 0, d = 0,  ret = 0;
	while(min(c, d) <= t) {
		if(c <= d) {
			ret += c - last > v;
		/**/last = c;
			c += a;
		}
		else {
			ret += d - last > v;
			last = d;
			d += b;
		}
	}
	return ret;
}
bool major(int Case = 1) {
	ll a = read(), b = read(), c = read(), d = read(), v = read(), t = read(), l = lcm(a, c);
	ll ans = (t / a + 1) * b + (t / c + 1) * d;
	if(t >= l)
	// ans -= solve(a, c, l, v, /*l*/l - 1) * (t / l) + solve(a, c, l, v, t % l);
		ans -= solve(a, c, -min(a, c), v, /*l*/l - 1) * (t / l - 1) + solve(a, c, -1e18, v, l - 1) + solve(a, c, -min(a, c), v, t % l);
	else
		ans -= solve(a, c, -1e18, v, t % l);
	writeln(ans);
	return Case ^= Case ^ Case;
}
void initial_function(int argc, char **argv) {
	**argv = argc; /* <- place_holder
	you won't give up no matter what happens, will you?
	code time: 
	---
	woc 样例一遍过 什么运气/kel/kel/kel
	
	草。第二个循环节可能 last 是前面的 lcm-min(a,b)，直接按 1e9 算可能会寄
	*/
}
signed main(int argc, char **argv) {
	initial_function(argc, argv);
	int Case = 1, Maxcase = 1;
	for (
#ifdef multiple_testcase
		  Maxcase = read()
#endif
				     	  ;
#ifndef infinite_testcase
							Case <= Maxcase
#endif
				     					   ; Case++)
#ifdef output_Yes_No
		puts(major(Case) ? Y_E_S : N__O);
#else
		major(Case);
#endif
	return DUST ^ 0x147;
}