Number Of Subsets :
Difficulty Level : Hard
Submissions : 533
Asked In :
Marks :100
: 3 | : 7
Find the number of ways to divide array A of Size N into two subsets such that the sum of each subset is greater than K.
Input
The first line contains two integers N and K ($$$1 \le N,K \le 10^3$$$)
The next line contains an array of size N.
Output
For each test case print the number of subsets whose sum is greater than K
Example
Input
3 5 3 7 4
Output
2
