#include <bits/stdc++.h>

/**
 * Author: Niyaz Nigmatullin
 *
 */

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

long long gcd(long long a, long long b) {
	return b == 0 ? a : gcd(b, a % b);
}

long long countForBlock(long long a, long long b, long long c, long long d, long long v, long long t) {
	long long up_to = (c / gcd(a, c));
	long long result = 0;
	for (long long i = 0; i < up_to; i++) {
		long long cur = i * a;
		if (cur > t) break;
		long long j = cur / c;
		if (cur - j * c > v) {
			result++;
		}
		long long next = (j + 1) * c;
		if (next > t) break;
		if (next - cur > v) {
			result++;
		}
		if (c > v) {
			long long right = min((i + 1) * a, t);
			long long count = (right - next) / c;
			result += count;
		}
	}
	// debug(t, result);
	return result;
}

long long solveSmart(long long a, long long b, long long c, long long d, long long v, long long t) {
	if (a < c) {
		swap(a, c);
		swap(b, d);
	}
	long long block_size = a * c / gcd(a, c);
	long long blocks = t / block_size;
	long long ans = (blocks > 0 ? countForBlock(a, b, c, d, v, block_size) * blocks : 0) + countForBlock(a, b, c, d, v, t % block_size);
	return (t / a) * b + (t / c) * d - ans + (b + d - 1);
}

long long solveStupid(long long a, long long b, long long c, long long d, long long v, long long t) {
	long long last = -(1LL << 60);
	long long ans = 0;
	for (long long i = 0; i <= t; i++) {
		auto press = [&]() {
			if (i - last <= v) {
				++ans;
			}
			last = i;
		};
		if (i % a == 0) {
			for (long long i = 0; i < b; i++) press();
		}
		if (i % c == 0) {
			for (long long i = 0; i < d; i++) press();
		}
	}
	return ans;
}

void solve() {
	long long a, b, c, d;
	long long v, t;
	cin >> a >> b >> c >> d >> v >> t;
	long long ans = solveSmart(a, b, c, d, v, t);
	// long long ans2 = solveStupid(a, b, c, d, v, t);
	// assert(ans == ans2);
	cout << ans << '\n';
}


mt19937 rng(787788);

void test() {
	for (int it = 0; it < 1000000; it++) {
		int a = rng() % 1000 + 1;
		int c = rng() % 1000 + 1;
		int b = rng() % 1000 + 1;
		int d = rng() % 1000 + 1;
		int v = rng() % 1000 + 1;
		int t = rng() % 10000 + 1;
		long long ans1 = solveSmart(a, b, c, d, v, t);
		long long ans2 = solveStupid(a, b, c, d, v, t);
		debug(ans1, ans2);
		assert(ans1 == ans2);
	}
}

int main() {
	std::cin.tie(NULL); std::ios::sync_with_stdio(false);
	// test();
	int t;
	cin >> t;
	while (t--) solve();
}