#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;

int main(){
    ll N,K;
    cin >> N >> K;
    vector<ll> A(N);
    rep(i,N){
        cin >> A[i];
    }
    vector<vector<ll> > dp(N + 1, vector<ll>(10101));
    rep(i,N + 1){
        rep(j,10101){
            dp[i][j] = 0;
        }
    }
    dp[0][0] = 1;
    rep(i,N){
        for (ll j = i; j >= 0; j--){
            for (ll k = 0; k <= 100 * j; k++){
                dp[j + 1][k + A[i]] = (dp[j + 1][k + A[i]] + dp[j][k]) % 1000000007;
            }
        }
    }
    ll ans = 0;
    for (ll i = 1; i < N + 1; i++){
        rep(j,10101){
            if (i * K <= j){
                ans = (ans + dp[i][j]) % 1000000007;
            }
        }
    }
    cout << ans << endl;
}