Coin Denominations

You are given an integer $C$ and an array $A$ = $A_1, A_2, \ldots, A_N$ which has distinct positive integers. It is guaranteed that $A_i \leq C$ for $1 \leq i \leq N$. You have an infinite supply of coins of denomination $A_i$ for $1 \leq i \leq N$. You have another array $W = W_1, W_2, \ldots W_N$. This denotes that a single coin of denomination $A_i$ has a weight of $W_i$. You are given $M$ que