#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <set>
#include <map>
#include <random>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define piii pair<int, pii>
#define plll pair<long long, pll>
#define tiii array<int, 3>
#define tiiii array<int, 4>
#define ff first
#define ss second
#define ee ss.ff
#define rr ss.ss
typedef long long ll;
const int INF = (int)1e9 + 7;

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int T; cin >> T;
	while(T--)
	{
		int a, b, c, d; ll v, t; cin >> a >> b >> c >> d >> v >> t; ++t;
		ll l = 1ll * a * c / __gcd(a, c);
		ll ans = -1, cyc = (l / a) * b + (l / c) * d, rem = ((t % l) / a + 1) * b + ((t % l) / c + 1) * d;
		// cout << "!!" << ans << ' ' << cyc << ' ' << rem << endl;
		vector<ll> A, B;
		for(ll i = 0; i < l; i += a) A.push_back(i);
		for(ll i = 0; i < l; i += c) B.push_back(i);
		vector<ll> C(A.size() + B.size());
		merge(A.begin(), A.end(), B.begin(), B.end(), C.begin());
		for(int i = 1; i < (int)C.size(); ++i) if(C[i] - C[i - 1] > v)
		{
			--cyc;
			if(C[i] < t % l) --rem;
		}
		if(l - C.back() > v) ++ans, --cyc, --rem;
		// cout << "!!!!" << ans << ' ' << cyc << ' ' << rem << endl;
		cout << ans + (t / l) * cyc + rem << '\n';
	}
}