dp[0]=1;
dfor(i,1,4) dfor(j,c[i],(int)1e5) dp[j]+=dp[j-c[i]];
dfor(i,1,15)
{
re int cnt=0,sum=0;
dfor(j,0,3)
if(i&(1<<j)) ++cnt,sum+=c[j+1]*(d[j+1]+1);
int f=cnt&1?-1:1;
if(s>=sum) ans+=f*dp[s-sum];
}
Think Twice, Code Once
#include
#define il inline
#define get getchar
#define put putchar
#define is isdigit
#define re register
#define int long long
#define dfor(i,a,b) for(re int i=a;i<=b;++i)
#define dforr(i,a,b) for(re int i=a;i>=b;--i)
#define dforn(i,a,b) for(re int i=a;i<=b;++i,put(10))
#define mem(a,b) memset(a,b,sizeof a)
#define memc(a,b) memcpy(a,b,sizeof a)
#define pr 114514191981
#define gg(a) cout<<a,put(32)
#define INF 0x7fffffff
#define tt(x) cout<<x<<'\n'
#define ls i<<1
#define rs i<<1|1
#define la(r) tr[r].ch[0]
#define ra(r) tr[r].ch[1]
#define lowbit(x) (x&-x)
using namespace std;
typedef unsigned int ull;
int read(void)
{
re int x=0,f=1;re char c=get();
while(!is(c)) (f=c==45?-1:1),c=get();
while(is(c)) x=(x<<1)+(x<<3)+(c^48),c=get();
return x*f;
}
void write(int x)
{
if(x<0) x=-x,put(45);
if(x>9) write(x/10);
put((x%10)^48);
}
#define writeln(a) write(a),put(10)
#define writesp(a) write(a),put(32)
#define writessp(a) put(32),write(a)
const int N=1e5+10,M=3e4+10,SN=1e4+10,mod=998244353;
int n,s,c[5],d[5],dp[N];
signed main()
{
dfor(i,1,4) c[i]=read();
n=read();
dp[0]=1;
dfor(i,1,4) dfor(j,c[i],(int)1e5) dp[j]+=dp[j-c[i]];
while(n--)
{
dfor(i,1,4) d[i]=read();
s=read();
re int ans=dp[s];
dfor(i,1,15)
{
re int cnt=0,sum=0;
dfor(j,0,3)
if(i&(1<<j)) ++cnt,sum+=c[j+1]*(d[j+1]+1);
int f=cnt&1?-1:1;
if(s>=sum) ans+=f*dp[s-sum];
}
writeln(ans);
}
return 0;
}