#include <bits/stdc++.h>

using namespace std;

#define F(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) x.begin(), x.end()
#define IOS ios_base::sync_with_stdio(0)

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

int main() {
  IOS;
  cin.tie(0), cout.tie(0);

  int T;
  cin >> T;
  ll a, b, c, d, v, t;
  while (T--) {
    cin >> a >> b >> c >> d >> v >> t;
    vector<ll> v1, v2;
    v1.push_back(0);
    ll cur = a % c;
    while (cur != 0) {
      v1.push_back(min(cur, a));
      cur = (cur + a) % c;
    }
    v2.push_back(0);
    cur = c % a;
    while (cur != 0) {
      v2.push_back(min(cur, c));
      cur = (cur + c) % a;
    }

    int cnt1 = 0, cnt2 = 0;
    for (auto x : v1) {
      if (x > v)
        cnt1++;
    }
    for (auto x : v2) {
      if (x > v)
        cnt2++;
    }
    int m1 = v1.size(), m2 = v2.size();
    ll delta = 0;
    delta += t / (m1 * a) * cnt1;
    if (min(m1 * a - v1[m1 - 1], a) > v || min(m2 * c - v2[m2 - 1], c) > v) {
      delta += t / (m1 * a);
    }
    delta += t / (m2 * c) * cnt2;
    int r = (t % (m1 * a)) / a + 1;
    F(i, 0, r) {
      if (v1[i] > v)
        delta++;
    }
    r = (t % (m2 * c)) / c + 1;
    F(i, 0, r) {
      if (v2[i] > v)
        delta++;
    }

    // t = 0
    delta++;

    cout << (t / a + 1) * b + (t / c + 1) * d - delta << '\n';
  }
}