Description

Xiao Wei, as a COIer, frequently submits and solves problems on OJ platforms, earning various types of OJ points.

Xiao Wei has four types of OJ points with denominations of $c_1$, $c_2$, $c_3$, and $c_4$.

Xiao Wei goes shopping $n$ times. For each shopping trip, he carries $d_i$ units of the $i$-th type of points and wants to purchase an item worth $s$. For each trip, determine how many ways there are to pay for the item.

Input Format

The first line of input consists of five integers: $c_1$, $c_2$, $c_3$, $c_4$, and $n$.
The next $n$ lines each contain five integers describing a shopping trip: $d_1$, $d_2$, $d_3$, $d_4$, and $s$.

Output Format

For each shopping trip, output a single integer representing the answer.

1 2 5 10 2
3 2 3 1 10
1000 2 2 2 900

4

Hint

【Data Range】

For 100% of the data, it is guaranteed that $1≤c_i, d_i, s≤10^5$, and $1≤n≤1000$.

Source

Adapted from a 2008 provincial selection problem.