// ?????¬???????????¬??????

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int N, W;
int w[210], acc[210];
int dp[201][10001];

signed main() {
    cin >> N >> W;
    rep(i,0,N) cin >> w[i];
    sort(w, w+N, greater<int>());

    rep(i,0,N) acc[i+1] = acc[i] + w[N-i-1];
    
    dp[0][0] = 1;
    rep(i,0,N) repq(j,0,W) {
        dp[i+1][j] = dp[i][j];
        if(j-w[i] >= 0) (dp[i+1][j] += dp[i][j-w[i]]) %= MOD;
    }
    repq(i,0,N) repq(j,1,W) (dp[i][j] += dp[i][j-1]) %= MOD;

    int ans = (W-acc[N] < 0 ? 0 : dp[N][W-acc[N]]);
    rep(i,0,N) {
        int sum = acc[i];
        if(W-sum < 0) continue;
        int vr = dp[N-i-1][W-sum];
        int vl = (W-sum-w[N-i-1] < 0 ? 0 : dp[N-i-1][W-sum-w[N-i-1]]);
        (ans += (vr - vl + MOD)) %= MOD;
    }
    cout << ans << endl;
    return 0;
}