Given n objects the ith of each cost ai.
Given q queries in the form of s,a, b.
Count the number of subsets that contains a and b but sum of cost does not exceed s.
K is the sum of all Ai
N,Q,K<=4000
Knapsack queries
Given n objects the ith of each cost ai.
Given q queries in the form of s,a, b.
Count the number of subsets that contains a and b but sum of cost does not exceed s.
K is the sum of all Ai
N,Q,K<=4000