#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

const int MOD = 1000000007;

int main()
{
    int n, w;
    cin >> n >> w;

    vector<int> x(n);
    for(int i=0; i<n; ++i)
        cin >> x[i];
    sort(x.begin(), x.end());

    if(x[0] > w || accumulate(x.begin(), x.end(), 0) <= w){
        cout << 1 << endl;
        return 0;
    }

    long long ret = 0;
    for(int i=0; i<n; ++i){
        if(x[i] > w)
            break;
        int sum = accumulate(x.begin(), x.begin()+i, 0);
        if(sum > w)
            break;

        vector<long long> dp(w+1, 0);
        dp[sum] = 1;
        for(int j=i+1; j<n; ++j){
            for(int k=w-x[j]; k>=0; --k){
                dp[k+x[j]] += dp[k];
                dp[k+x[j]] %= MOD;
            }
        }
        ret += accumulate(dp.end()-x[i], dp.end(), 0);
        ret %= MOD;
    }

    cout << ret << endl;

    return 0;
}