https://codeforces.com/problemset/problem/1223/C

#include <queue>
#include <iostream>
#include <algorithm>

using namespace std;
typedef long long LL;
const int N = 200010;
LL val[N];
LL n , m , k , a , b , x , y;

LL check(int mid){
    priority_queue<int> pq;
    LL res = 0;
    for(int i=1;i<=mid;i++){
        if(i%a==0 && i%b==0){
            pq.push(x+y);
        }else if(i%a==0){
            pq.push(x);
        }else if(i%b == 0){
            pq.push(y);
        }
    }

    int cnt = n;
    while(!pq.empty()){
        res += (val[cnt--])*pq.top();
        pq.pop();
    }// 每次选择最大的比例来计算贡献
    return res >= k;
}

int find(){
    int l = 1 , r = n+1;//假设n+1是一定行的，如果到了n+1说明无界
    int res = n+1;
    while(l<=r){
        int mid = (l+r)>>1;
        if(check(mid)){
            r = mid-1;
            res = mid;
        }else{
            l = mid+1;
        }
    }
    return res;
}


void solve(){
    scanf("%lld",&n);

    for(int i=1;i<=n;i++){
        scanf("%lld",val+i);
        val[i]/=100;
    }

    scanf("%lld%lld",&x,&a);//数据量比较大
    scanf("%lld%lld",&y,&b);
    scanf("%lld",&k);


    sort(val+1,val+n+1);

    //for(int i=1;i<=n;i++) cout<<val[i]<<" ";

    LL ans = find();
    if(ans != n+1){
        printf("%lld",ans);
    }else{
        printf("-1");
    }

    printf("\n");
}

int main(){

    int t;
    cin>>t;

    while(t--) solve();

    return 0;
}