Subset Sums Revisited

You are given a sequence $A$ of $N$ integers: $(A_1, A_2, \ldots, A_N)$. From this sequence, you create another sequence of size $N$: $B = (B_1, B_2, \ldots, B_N)$, where $B_i = 2^{A_i}$. You are also given an integer $K$. You need to output the number of subsequences of $B$ whose sum is exactly $K$. Since the answer might be huge, output it modulo $10^9+7$. ### Input - The first line contains t