#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 1000000007;

struct mint {
    int x;
    mint() : x(0) {}
    mint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
    mint& operator+=(const mint& p){
        if((x += p.x) >= mod)   x -= mod;
        return *this;
    }
    mint& operator-=(const mint& p){
        if((x -= p.x) < 0)  x += mod;
        return *this;
    }
    mint& operator*=(const mint& p){
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    mint& operator/=(const mint& p){
        *this *= p.inverse();
        return *this;
    }
    mint operator-() const { return mint(-x); }
    mint operator+(const mint& p) const { return mint(*this) += p; }
    mint operator-(const mint& p) const { return mint(*this) -= p; }
    mint operator*(const mint& p) const { return mint(*this) *= p; }
    mint operator/(const mint& p) const { return mint(*this) /= p; }
    bool operator==(const mint& p) const { return x == p.x; }
    bool operator!=(const mint& p) const { return x != p.x; }
    mint pow(int64_t n) const {
        mint res = 1, mul = x;
        while(n > 0){
            if(n & 1)   res *= mul;
            mul *= mul;
            n >>= 1;
        }
        return res;
    }
    mint inverse() const { return pow(mod - 2); }
    friend ostream& operator<<(ostream& os, const mint& p){
        return os << p.x;
    }
    friend istream& operator>>(istream& is, mint& p){
        int64_t val;
        is >> val;
        p = mint(val);
        return is;
    }
};

mint dp[101][101][10001];

int main(){
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    for(int i = 0; i < N; ++i)  cin >> A[i];
    
    dp[0][0][0] = 1;
    for(int i = 0; i < N; ++i){
        for(int j = 0; j <= i; ++j){
            for(int k = 0; k <= 100 * j; ++k){
                if(dp[i][j][k] == 0)    continue;
                dp[i + 1][j][k] += dp[i][j][k];
                dp[i + 1][j + 1][k + A[i]] += dp[i][j][k];
            }
        }
    }
    
    mint ans = 0;
    for(int i = 1; i <= N; ++i){
        for(int j = K * i; j <= 100 * i; ++j){
            ans += dp[N][i][j];
        }
    }
    
    cout << ans << '\n';
}