#include<bits/stdc++.h>

#define N 100005

typedef long long ll;

using namespace std;

ll ans,f[N];

int c[],d[],T;

void dfs(int x,int k,int sum){

    if(sum<)return;

    if(x==){

        if(k&)ans-=f[sum];

        else ans+=f[sum];

        return ;

    }

    dfs(x+,k+,sum-(d[x]+)*c[x]);

    dfs(x+,k,sum);

}

inline int read(){

    int f=,x=;char ch;

    do{ch=getchar();if(ch=='-')f=-;}while(ch<''||ch>'');

    do{x=x*+ch-'';ch=getchar();}while(ch>=''&&ch<='');

    return f*x;

}

int main(){

    for(int i=;i<=;i++)c[i]=read();

    T=read();f[]=;

    for(int i=;i<=;i++)for(int j=c[i];j<=;j++)f[j]+=f[j-c[i]];

    while(T--){

        for(int i=;i<=;i++)d[i]=read();

        int x=read();ans=;

        dfs(,,x);

        printf("%lld\n",ans);

    }

    return ;

}