#include<bits/stdc++.h>


using namespace std;
using ll = long long;
inline int ri() {int _; cin >> _; return _;}
const int AS = 10000;
constexpr ll mod = 1e9 + 7;

int main()
{
	int n, k; cin >> n >> k;
	vector<int> a(n);
	for(int i = 0; i < n; i++)a[i] = ri() - k;
	vector<map<int,int>> dp(n + 1);
	dp[0][0] = 1;

	for(int i = 0; i < n; i++) {
		for(int j = -AS; j <= AS; j++) {
			dp[i + 1][j + a[i]] += dp[i][j];
			dp[i + 1][j + a[i]] %= mod;
			dp[i + 1][j] += dp[i][j];
			dp[i + 1][j] %= mod;
		}
	}

	ll sum = 0;
	for(int i = 0; i <= AS; i++) {
		sum += dp[n][i];
		sum %= mod;
	}

	cout << ((sum - 1) % mod + mod) % mod << endl;
}