#include "bits/stdc++.h"

//#include <atcoder/all>

using namespace std;
//using namespace atcoder;

//#define int long long
#define ll long long

ll INF = (1LL << 60);
int mod = 1000000007;
using P = pair<int, int>;
int dp[2][110][10010];
signed 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++) {
		vector<vector<int>>dp2(N + 2, vector<int>(10011));
		for (int j = 0; j <= N; j++) {
			for (int k = 0; k < 10001; k++) {
				int now = 0;
				(now += dp[i%2][j][k]) %= mod;
				now %= mod;
				(dp2[j][k] += now)%=mod;
				if (k + A[i] <= 10010)(dp2[j + 1][k + A[i]] += now) %= mod;
			}
		}
		for (int j = 0; j <= N; j++) {
			for (int k = 0; k < 10001; k++) {
				dp[(i+1)%2][j][k] = dp2[j][k];
			}
		}
	

		
	}
	int ans = 0;
	for (int j = 1; j <= N; j++) {
		for (int k = j * K; k <= 10009; k++) {
			ans += dp[N % 2][j][k];
			
			ans %= mod;
		}
	}
	cout << ans << endl;
	return 0;
}