#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) { 
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;

template<ll MOD>
struct modint {
    ll x;
    modint(): x(0) { }
    modint(ll y) : x(y>=0 ? y%MOD : y%MOD+MOD) {}
    ll get() const { return x; }
    // e乗
    modint pow(ll e) {
        ll a = 1, p = x;
        while(e > 0) {
            if(e%2 == 0) {p = (p*p) % MOD; e /= 2;}
            else {a = (a*p) % MOD; e--;}
        }
        return modint(a);
    }
    // Comparators
    bool operator <(modint b) { return x < b.x; }
    bool operator >(modint b) { return x > b.x; }
    bool operator<=(modint b) { return x <= b.x; }
    bool operator>=(modint b) { return x >= b.x; }
    bool operator!=(modint b) { return x != b.x; }
    bool operator==(modint b) { return x == b.x; }
    // increment, decrement
    modint operator++() { x++; return *this; }
    modint operator++(signed) { modint t = *this; x++; return t; }
    modint operator--() { x--; return *this; }
    modint operator--(signed) { modint t = *this; x--; return t; }
    // Basic Operations
    modint &operator+=(modint that) {
        x += that.x;
        if(x >= MOD) x -= MOD;
        return *this;
    }
    modint &operator-=(modint that) {
        x -= that.x;
        if(x < 0) x += MOD;
        return *this;
    }
    modint &operator*=(modint that) {
        x = (ll)x * that.x % MOD;
        return *this;
    }
    modint &operator/=(modint that) {
        x = (ll)x * that.pow(MOD-2).x % MOD;
        return *this;
    }
    modint &operator%=(modint that) {
        x = (ll)x % that.x;
        return *this;
    }
    modint operator+(modint that) const { return modint(*this) += that; }
    modint operator-(modint that) const { return modint(*this) -= that; }
    modint operator*(modint that) const { return modint(*this) *= that; }
    modint operator/(modint that) const { return modint(*this) /= that; }
    modint operator%(modint that) const { return modint(*this) %= that; }
};
using mint = modint<1000000007>;
// Input/Output
ostream &operator<<(ostream& os, mint a) { return os << a.x; }
istream &operator>>(istream& is, mint &a) { return is >> a.x; }

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, W;
    cin >> n >> W;
    vector<ll> w(n);
    REP(i, n) cin >> w[i];
    sort(ALL(w), greater<>());

    auto dp = make_v<mint>(n+1, W+1);
    dp[0][0] = 1;
    REP(i, n) REP(j, W+1) {
        dp[i+1][j] += dp[i][j];
        if(j+w[i]<=W) dp[i+1][j+w[i]] += dp[i][j];
    }

    reverse(ALL(w));
    ll sum = 0;
    mint ret = 0;
    REP(i, n) {
        for(ll j=max(0LL, W-sum-w[i]+1); j<=W-sum-(i?w[i-1]:0); ++j) {
            ret += dp[n-i][j];
        }
        sum += w[i];
    }
    cout << ret << endl;

    return 0;
}


Measured memory_bytes: 18580