#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);
const int MOD = 1e9 + 7;

int dp[100+1][20000+1];

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  REP (i, n) {
    cin >> a[i];
    a[i] -= k;
  }

  int offset = 10000;
  dp[0][0 + offset] = 1;

  REP (i, n) {
    for (int j = -10000; j <= 10000; j++) {
      dp[i+1][j + offset] = dp[i][j + offset];
      if (-10000 <= j - a[i] && j - a[i] <= 10000) {
        dp[i+1][j + offset] += dp[i][j - a[i] + offset];
      }
    }
  }

  int ret = MOD - 1;
  for (int i = 0; i <= 10000; i++) {
    ret += dp[n][i + offset];
    ret %= MOD;
  }
  
  cout << ret << endl;
    
  return 0;
}