You're given $$$n$$$ integers $$$a_1,a_2,\dots,a_n$$$, you need to count the number of ways to choose some of them (no duplicate) to make the sum equal to $$$S$$$, in modulo $$$10^9+7$$$. How to solve this problem in polynomial time?