#include <bits/stdc++.h>

using namespace std;

#define int long long
#define lep(i, l, r) for(int i = (l); i <= (r); i ++)
#define rep(i, l, r) for(int i = (l); i >= (r); i --)

using i64 = long long;

const int N = 1e5 + 5;

int _case;

void solve() {
	++ _case;
	cerr << _case << endl;
	int a, b, c, d, v, t;
	cin >> a >> b >> c >> d >> v >> t;
	
	auto brute = [&] () -> int {
		int ans = b + d - 1;
		int nowa = 0, nowc = 0, lst = 0, nowpos = 0;
		while (1) {
			int nxa = nowa + a;
			int nxc = nowc + c;
			int pa = 0, pc = 0;
			
			nowpos = min (nxa, nxc);
			
			if (nowpos > t) break;
			
			if (nowpos == nxa) nowa += a, pa = 1;
			if (nowpos == nxc) nowc += c, pc = 1;
			
			ans += pa * b + pc * d;
			
			int len = nowpos - lst;
			if (len > v) -- ans;
			
			lst = nowpos; 
			
		//	cerr << nowpos << endl;
		}
		
		return ans;
	} ;
	
	//cout << brute() << endl;
	//return ;
	
	if (a * c > t) { // solver for [0, t] (a * c > t)
		cout << brute() << '\n';
		return ;
	}
	
	else {
		// solver for [0, a * c - 1] (a * c > t)
		int ans = b + d - 1;
		int nowa = 0, nowc = 0, lst = 0, nowpos = 0, lstlen = 0;
		while (1) {
			int nxa = nowa + a;
			int nxc = nowc + c;
			int pa = 0, pc = 0;
			
			nowpos = min (nxa, nxc);
			
			if (nowpos == a * c) break;
			
			if (nowpos == nxa) nowa += a, pa = 1;
			if (nowpos == nxc) nowc += c, pc = 1;
			
			ans += pa * b + pc * d;
			
			int len = nowpos - lst;
			if (len > v) -- ans;
			
			lstlen = len;
			
			lst = nowpos; 
			
		}

		int block_ans = ans;
		int blocks = t / (a * c);
		ans = block_ans * blocks;
		
		//cerr << blocks << endl;
		
		//cerr << lstlen << endl;
				
		if (lstlen <= v) {
			ans += blocks - 1;
		}
		
		nowa = nowc = blocks * a * c;
		lst = nowpos = nowa;
		
		
		if (lstlen > v) ans --;
		
		//t = nowpos - 1;
		
		//cerr << brute() << endl;
		//cerr << ans << ' ' << nowpos << endl;
		
		//return ;
		ans += b + d;
		
		
		while (1) {
			int nxa = nowa + a;
			int nxc = nowc + c;
			int pa = 0, pc = 0;
			
			nowpos = min (nxa, nxc);
			
			if (nowpos > t) break;
			
			if (nowpos == nxa) nowa += a, pa = 1;
			if (nowpos == nxc) nowc += c, pc = 1;
			
			ans += pa * b + pc * d;
			
			int len = nowpos - lst;
			if (len > v) -- ans;
			
			lstlen = len;
			
			lst = nowpos; 
			
		}
		
		cout << ans << '\n';
		cerr << ans << ' ' << brute() << '\n';
		assert (ans == brute());
		return ;
	}
	assert (false);
}

signed main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int Case;
	cin >> Case;
	while (Case --) solve();
	return 0;
}