#include <iostream>
#include <vector>
using namespace std;
const int MOD = 1e9 + 7;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    for(int i = 0; i < N; i++) cin >> A[i];
    int ans = 0;
        vector<vector<vector<int>>> dp(N + 1, vector<vector<int>>(N + 1, vector<int>(K * N + 1, -1)));
        dp[0][0][0] = 1;
        for(int i = 0; i < N; i++){
            for(int j = 0; j < N; j++){
                for(int k = 0; k < K * N + 1; k++){
                    if(dp[i][j + 1][k] == -1) dp[i][j + 1][k] = dp[i][j][k];
                    else if(dp[i][j][k] != -1) dp[i][j + 1][k] = (dp[i][j][k] + dp[i][j + 1][k]) % MOD;
                    if(k + A[j] <= K * N && dp[i][j][k] != -1) {
                        if(dp[i + 1][j + 1][k + A[j]] == -1) dp[i + 1][j + 1][k + A[j]] = dp[i][j][k];
                        else dp[i + 1][j + 1][k + A[j]] = (dp[i][j][k] + dp[i + 1][j + 1][k + A[j]]) % MOD;
                    }
                    else if(k + A[j] > K * N && dp[i][j][k] != -1){
                        if(dp[i + 1][j + 1][K * N] == -1) dp[i + 1][j + 1][K * N] = dp[i][j][k];
                        else dp[i + 1][j + 1][K * N] = (dp[i][j][k] + dp[i + 1][j + 1][K* N]) % MOD;
                    }
                }
            }
        }
    for(int i = 1; i < N + 1; i++){
        for(int j = 0; j < K * N + 1; j++){
            if(dp[i][N][j] != -1 && j >= i * K) ans = (ans + dp[i][N][j]) % MOD;
        }
    }
    cout << ans << endl;
}