there are 3 types of queries 0 X add a number X 1 X remove the number X (X always exist) 2 X return the number of subsets that sum to X

0<=X<=10^3 0<=number of queries <=10^3

I tried to implement this using the knapsack approach but its bound to give TLE

any suggestions? Any help would be appreciated