# include <cstdio>
# include <algorithm>
using namespace std;
const int NR=2e5+10;
int a[NR], qu[NR];

bool cmp(int x, int y)
{
    return x>y;
}

int main()
{
    int n, L, v;
    scanf("%d %d %d", &n, &L, &v); 
    for(int i=1; i<=n; i++)
    {
        scanf("%d", &a[i]);
    }
    sort(a+1, a+n+1, cmp);
    int q;
    scanf("%d", &q);
    for(int i=1; i<=q; i++)
    {
        scanf("%d", &qu[i]);
    }
    for(int i=1; i<=q; i++)
    {
        int timen=0, dist=L, j;
        bool flag=false;
        for(j=0; j<n; j++)
        {
            if(dist>qu[i]*v)
            {
                flag=true;
                break;
            }
            dist+=a[j+1];
        }
        if(flag==true) printf("%d\n", j);
        else printf("-1\n");
    }
    return 0;
}