#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9+7;

int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i,n) cin >> a[i];
  vector<vector<int>> dp(n + 1, vector<int>(10001, 0));
  dp[0][0] = 1;

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

  int res = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= 10000; j++) {
      if (j >= k * i) (res += dp[i][j]) %= mod;
    }
  }

  cout << (res - 1 + mod) % mod << endl;
  return 0; 
}