C. Save the Nature

 http://codeforces.com/contest/1241/problem/C

#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=2e5+9;

int n;
ll p[N];
ll k;
ll vis[N];
ll tmp[N];

bool ch(int mid)
{
    for(int i=1;i<=mid;i++) tmp[i]=vis[i];
    sort(tmp+1,tmp+1+mid,greater<int>());

    ll ans=0;
    for(int i=1;i<=mid;i++)
    {
        ans+=p[i]/100*tmp[i];
    }
    return ans>=k;
}

int main()
{
    FAST_IO;

    int T;
    cin>>T;
    while(T--)
    {
        cin>>n;
        for(int i=1;i<=n;i++) cin>>p[i];
        for(int i=1;i<=n;i++ )vis[i]=0;
        sort(p+1,p+1+n,greater<int>());

        int x,a,y,b;
        cin>>x>>a>>y>>b;;
        cin>>k;

        for(int i=1;i<=n;i++)
        {
            if(i%a==0) vis[i]+=x;
            if(i%b==0) vis[i]+=y;
        }

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

        ll ans=-1;
        int l=1,r=n;
        while(l<=r)
        {
            int mid=(l+r)>>1;
            if(ch(mid))
            {
                ans=mid;
                r=mid-1;
            }
            else l=mid+1;
        }

        cout<<ans<<endl;

    }

    return 0;
}