/**************************************************************

     Problem: 1042

     User: Vortex

     Language: C++

     Result: Accepted

     Time:60 ms

     Memory:2068 kb

 ****************************************************************/

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cstdio>

 #include<sstream>

 #include<vector>

 #include<stack>

 #include<queue>

 #include<cmath>

 #include<map>

 #include<set>

 using namespace std;

 typedef long long ll;

 typedef pair<int,int> pll;

 const int INF = 0x3f3f3f3f;

 const int maxn =  + ;

 int s;

 ll ans;

 int c[],d[];

 ll f[maxn];

 void init()

 {

     memset(f,,sizeof(f));

     f[]=;

     for(int i=;i<=;i++)

     {

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

             f[j]+=f[j-c[i]];

     }

 }

 void dfs(int cur, int cnt, int sum)

 {

     if(sum<) return;

     if(cur==)

     {

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

         else ans+=f[sum];

         return;

     }

     dfs(cur+,cnt+,sum-(d[cur]+)*c[cur]);

     dfs(cur+,cnt,sum);

 }

 int main()

 {

     //freopen("in.txt","r",stdin);

     int T;

     for(int i=;i<=;i++)  scanf("%d",&c[i]);

     scanf("%d",&T);

     init();

     while(T--)

     {

         for(int i=;i<=;i++)  scanf("%d",&d[i]);

         scanf("%d",&s);

         ans=;

         dfs(,,s);

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

     }

     return ;

 }