Number of ways of dividing an array into 2 parts such that sum of each part is >= k?

You are given N numbers which you must divide into two sets. Find me
how many ways can the integers be divided into two sets so that each set
to have a total sum greater than or equal to an integer S. In each set can
there must be a different number of integers.
Input data
• The first line contains two integers separated by a space: The N where
denotes the number of integers and S.
• The second line contains N integers.
Input data
An integer, in how many possible ways can the two be separated
totals. The number should appear modulo 109 + 7.
Input Example
5 12
3 4 5 6 7
Exit Example
4
Illustration
The two sets that can be created in each case are the following:
1. [3, 4, 5] - [6, 7]
2. [3, 4, 6] - [5, 7]
3. [6, 7] - [3, 4, 5]
4. [5, 7] - [3, 4, 6]