#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000

typedef long long ll;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};

ll dp[210][10010];
int w[210];
int sum[210];
const ll MOD = 1000000007;

int main(void) {
    int N, W;
    cin >> N >> W;
    for (int i = 1; i <= N; i++) {
        cin >> w[i];
    }
    sort(w, w+N+1);
    for (int i = 1; i <= N; i++) {
        sum[i] = sum[i-1] + w[i];
    }
    if (sum[N] <= W || N == 1) {
        cout << 1 << endl;
        return 0;
    }
    ll ans = 0;
    for (int i = 0; i < N; i++) {
        int rest = W - sum[i];
        if (rest < 0) break;
        for (int j = i+1; j <= N; j++) {
            for (int k = sum[i]; k <= W; k++) {
                dp[j][k] = 0;
            }
        }
        dp[i+1][sum[i]] = 1;
        for (int j = i+1; j < N; j++) {
            for (int k = sum[i]; k <= W; k++) {
                if (dp[j][k] == 0) continue;
                dp[j+1][k] += dp[j][k];
                int tmp = k+w[j+1];
                if (tmp <= W) {
                    dp[j+1][tmp] += dp[j][k];
                }
            }
        }
        for (int j = W-w[i+1]+1; j <= W; j++) {
            ans = (ans + dp[N][j]) % MOD;
        }
    }
    cout << ans << endl;
    return 0;
}