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

     Problem: 1042

     User: Tunix

     Language: C++

     Result: Accepted

     Time:40 ms

     Memory:2052 kb

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

 //BZOJ 1042

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 inline int getint(){

     int v=,sign=; char ch=getchar();

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

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

     return v*sign;

 }

 const int N=1e5+,INF=~0u>>;

 typedef long long LL;

 /******************tamplate*********************/

 int c[],d[],s,n;

 LL ans,f[N];

 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);

 }

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("1042.in","r",stdin);

     freopen("1042.out","w",stdout);

 #endif

     F(i,,) c[i]=getint(); n=getint();

     f[]=;

     F(i,,) F(j,c[i],1e5) f[j]+=f[j-c[i]];

     F(i,,n){

         F(i,,) d[i]=getint(); s=getint();

         ans=;

         dfs(,,s);

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

     }

     return ;

 }