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

ll const MOD = 1e9+7;
ll dp[105][21000];

int main(){
  int n, k; cin >> n >> k;
  vector<int> a(n);
  for(int i = 0; i < n; i++){
    int A; cin >> A;
    A -= k;
    a[i] = A;
  }
  dp[0][10000] = 1;
  for(int i = 0; i < n; i++){
    for(int j = -10000; j <= 10000; j++){
      dp[i+1][j+10000] = (dp[i][j+10000])%MOD;
      dp[i+1][j+10000] = (dp[i+1][j+10000]+dp[i][j-a[i]+10000])%MOD;
    }
  }
  ll ans = 0;
  for(int i = 0; i <= 10000; i++){
    ans += (dp[n][i+10000])%MOD;
  }
  ans--;
  ans = (ans+MOD)%MOD;
  cout << ans << endl;
  return 0;
}