#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B, typename C>
struct triple {
  A X;
  B Y;
  C Z;
  triple(A a = 0, B b = 0, C c = 0) : X(a), Y(b), Z(c) {}
};
template <typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
  return triple<A, B, C>(a, b, c);
}
template <typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
  if (a.X != b.X) return a.X < b.X;
  if (a.Y != b.Y) return a.Y < b.Y;
  return a.Z < b.Z;
}
template <typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
  ofs << "( " << p.first << " , " << p.second << " )";
  return ofs;
}
template <typename T>
void print(T a) {
  for (auto i : a) cout << i << ' ';
  cout << '\n';
}
template <typename T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <typename T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
bool can(deque<long long> p, long long a, long long b, long long x, long long y,
         long long n, long long k, long long m) {
  long long xy = a * b / gcd(a, b);
  long long usexy = m / (xy);
  long long ans = 0;
  for (long long _ = 0; _ < (usexy); _++)
    if (p.size()) {
      ans += p.front() * (x + y);
      p.pop_front();
    }
  if (ans >= k) return 1;
  long long usex = m / a - usexy;
  for (long long _ = 0; _ < (usex); _++)
    if (p.size()) {
      ans += p.front() * x;
      p.pop_front();
    }
  if (ans >= k) return 1;
  long long usey = m / b - usexy;
  for (long long _ = 0; _ < (usey); _++)
    if (p.size()) {
      ans += p.front() * y;
      p.pop_front();
    }
  if (ans >= k) return 1;
  return 0;
}
long long solve() {
  long long n;
  cin >> n;
  deque<long long> p(n);
  for (auto& i : p) {
    cin >> i;
    i /= 100;
  }
  long long x, a, y, b;
  cin >> x >> a >> y >> b;
  if (x < y) swap(x, y), swap(a, b);
  long long k;
  cin >> k;
  sort(p.rbegin(), p.rend());
  long long l = 1, r = n + 1;
  if (!can(p, a, b, x, y, n, k, n)) return -1;
  while (r - l > 1) {
    long long m = l + r >> 1;
    if (can(p, a, b, x, y, n, k, m))
      r = m;
    else
      l = m;
  }
  if (can(p, a, b, x, y, n, k, l)) return l;
  return r;
}
signed main() {
  srand(time(NULL));
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  long long q;
  cin >> q;
  while (q--) cout << solve() << '\n';
}
