硬币购物一共有4种硬币。面值分别为c1,c2,c3,c4。某人去商店买东西，去了tot次。每次带di枚ci硬币，买si的价值的东西。请问每次有多少种付款方法。

第一行 c1,c2,c3,c4,tot 下面tot行 d1,d2,d3,d4,s

每次的方法数

{$inline on}const maxn=100000+1000;var i,j,n,m:longint;    f:array[0..maxn] of int64;    ans,t1,t2,t3,t4:int64;    c:array[1..4] of int64;procedure init; begin   readln(c[1],c[2],c[3],c[4],n); end;function g(x:int64):int64;inline; begin   if x>=0 then exit(f[x]);   exit(0); end;procedure main; begin   f[0]:=1;   for i:=1 to 4 do    for j:=1 to maxn do     inc(f[j],g(j-c[i]));   //for i:=0 to maxn do writeln(i,‘ ‘,f[i]);   for i:=1 to n do    begin      readln(t1,t2,t3,t4,m);      ans:=f[m];      t1:=(t1+1)*c[1];t2:=(t2+1)*c[2];t3:=(t3+1)*c[3];t4:=(t4+1)*c[4];      //dec(ans,g(m-t1));dec(ans,g(m-t2));dec(ans,g(m-t3));dec(ans,g(m-t4));      //dec(ans,g(m-t1-t2-t3));dec(ans,g(m-t1-t2-t4));dec(ans,g(m-t1-t3-t4));dec(ans,g(m-t2-t3-t4));      //inc(ans,g(m-t1-t2));inc(ans,g(m-t1-t3));inc(ans,g(m-t1-t4));inc(ans,g(m-t2-t3));inc(ans,g(m-t2-t4));inc(ans,g(m-t3-t4));      //inc(ans,g(m-t1-t2-t3-t4));      dec(ans,g(m-t1)+g(m-t2)+g(m-t3)+g(m-t4));      dec(ans,g(m-t1-t2-t3)+g(m-t1-t2-t4)+g(m-t1-t3-t4)+g(m-t2-t3-t4));      inc(ans,g(m-t1-t2)+g(m-t1-t3)+g(m-t1-t4)+g(m-t2-t3)+g(m-t2-t4)+g(m-t3-t4));      inc(ans,g(m-t1-t2-t3-t4));      writeln(ans);    end; end;begin  assign(input,‘input.txt‘);assign(output,‘output.txt‘);  reset(input);rewrite(output);  init;  main;  close(input);close(output);end.