#include <bits/stdc++.h>
#pragma GCC optimize(2)
const int inf = 0x3f3f3f3f, Inf = 0x7fffffff;
const long long INF = 0x7fffffffffffffff;
const double eps = 1e-8;
unsigned int seed = 19260817;
const unsigned int _RAND_MAX_ = 4294967295u;
__inline__ __attribute__((always_inline)) unsigned int Rand() {
  return seed = seed * 998244353u + 1000000007u;
}
template <typename _Tp>
_Tp gcd(const _Tp &a, const _Tp &b) {
  return (!b) ? a : gcd(b, a % b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp abs(const _Tp &a) {
  return a > 0 ? a : -a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp max(const _Tp &a, const _Tp &b) {
  return a < b ? b : a;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) _Tp min(const _Tp &a, const _Tp &b) {
  return a < b ? a : b;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmax(_Tp &a, const _Tp &b) {
  (a < b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void chmin(_Tp &a, const _Tp &b) {
  (a > b) && (a = b);
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) bool _cmp(const _Tp &a,
                                                    const _Tp &b) {
  return abs(a - b) <= eps;
}
template <typename _Tp>
__inline__ __attribute__((always_inline)) void read(_Tp &x) {
  register char ch(getchar());
  bool f(false);
  while (ch < 48 || ch > 57) f |= ch == 45, ch = getchar();
  x = ch & 15, ch = getchar();
  while (ch >= 48 && ch <= 57)
    x = (((x << 2) + x) << 1) + (ch & 15), ch = getchar();
  if (f) x = -x;
}
template <typename _Tp, typename... Args>
__inline__ __attribute__((always_inline)) void read(_Tp &t, Args &...args) {
  read(t);
  read(args...);
}
__inline__ __attribute__((always_inline)) int read_str(char *s) {
  register char ch(getchar());
  while (ch == ' ' || ch == '\r' || ch == '\n') ch = getchar();
  register char *tar = s;
  *tar = ch, ch = getchar();
  while (ch != ' ' && ch != '\r' && ch != '\n' && ch != EOF)
    *(++tar) = ch, ch = getchar();
  return tar - s + 1;
}
const int N = 200005;
long long p[N];
long long n, x, a, y, b;
long long k, lcm;
bool check(int mid) {
  int t = mid / lcm;
  long long ans = 0;
  for (int i = 1; i <= t; ++i) {
    ans += (x + y) * p[i];
  }
  int t1 = mid / a - t;
  int t2 = mid / b - t;
  if (x > y) {
    for (int i = 1; i <= t1; ++i) {
      if (t < n) {
        ans += x * p[++t];
      }
    }
    for (int i = 1; i <= t2; ++i) {
      if (t < n) {
        ans += y * p[++t];
      }
    }
  } else {
    for (int i = 1; i <= t2; ++i) {
      if (t < n) {
        ans += y * p[++t];
      }
    }
    for (int i = 1; i <= t1; ++i) {
      if (t < n) {
        ans += x * p[++t];
      }
    }
  }
  return ans >= k;
}
void MAIN() {
  read(n);
  for (int i = 1; i <= n; ++i) read(p[i]), p[i] /= 100;
  std::sort(p + 1, p + n + 1);
  std::reverse(p + 1, p + n + 1);
  read(x, a, y, b);
  read(k);
  lcm = 1ll * a * b / gcd(a, b);
  int l = 1, r = n;
  while (l < r) {
    int mid = (l + r) >> 1;
    if (check(mid))
      r = mid;
    else
      l = mid + 1;
  }
  if (check(l))
    printf("%d\n", l);
  else
    printf("-1\n");
}
int main() {
  int _;
  read(_);
  while (_--) MAIN();
  return 0;
}
