#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;

#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll mod = 1000000007;
struct SegmentTree {
private:
    int n;
    vector<int> node;
 
public:
    SegmentTree() {
        int sz = 10010;
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, INF);
        for(int i=0; i<sz; i++) node[i+n-1] = 0;
        for(int i=n-2; i>=0; i--) node[i] = min(node[2*i+1], node[2*i+2]);
    }

    void add(int x, int val) {
        x += (n - 1);
        node[x] = (node[x] + val) % mod;
        while(x > 0) {
            x = (x - 1) / 2;
            node[x] = (node[2*x+1] + node[2*x+2]) % mod;
        }
    }
 
    void update(int x, int val) {
        x += (n - 1);
        node[x] = val;
        while(x > 0) {
            x = (x - 1) / 2;
            node[x] = (node[2*x+1] + node[2*x+2]) % mod;
        }
    }
    // hannkaikukann 
    int getsum(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        if(r <= a || b <= l) return 0;
        if(a <= l && r <= b) return node[k];
 
        int vl = getsum(a, b, 2*k+1, l, (l+r)/2);
        int vr = getsum(a, b, 2*k+2, (l+r)/2, r);
        return (vl + vr) % mod;
    }
};


int main() {
    //cout.precision(10);
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, W;
    cin >> N >> W;
    vector<int> w(N);
    for(int i = 0; i < N; i++) cin >> w[i];
    w.push_back(-1);
    w.push_back(W + 1);
    sort(w.begin(), w.end());
    vector<int> wsum(N + 1);
    for(int i = 1; i <= N; i++) {
        wsum[i] = wsum[i-1] + w[i];
    }
    SegmentTree seg;
    seg.add(W, 1);
    int ans = 0;
    if(wsum[N] <= W) {
        cout << 1 << endl;
        return 0;
    }
    for(int index = N + 1; index >= 2; index--) {
        for(int val = 0; val <= W; val++) {
            if(w[index] + val <= W) {
                int ADD = seg.getsum(val + w[index], val + w[index] + 1);
                seg.add(val, ADD);
            }
        }
        int lowerbound = 0;
        int upperbound = w[index-1];
        lowerbound += wsum[index-2];
        lowerbound = min(lowerbound, W + 1);
        upperbound += wsum[index-2];
        upperbound = min(upperbound, W + 1);
        ans = (ans + seg.getsum(lowerbound, upperbound)) % mod;
    }
    cout << ans << endl;
    return 0;
}

