#include <bits/stdc++.h>
using namespace std;
const int N = 201, S = 1501, MOD = 1e9 + 7;
int a[N], dif[N], dp[2][N][S];
int mul(int a, int b) { return 1ll * a * b % MOD; }
void sum(int &a, const int &b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, s;
  cin >> n >> s;
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 1; i < n; i++) dif[i] = a[i] - a[i - 1];
  dp[0][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i; j++) {
      for (int k = dif[i] * j; k <= s; k++) {
        dp[i & 1][j][k] = mul(dp[i & 1 ^ 1][j][k - dif[i] * j], j + 1);
        if (j > 0) sum(dp[i & 1][j][k], dp[i & 1 ^ 1][j - 1][k - dif[i] * j]);
        if (j < i)
          sum(dp[i & 1][j][k],
              mul(dp[i & 1 ^ 1][j + 1][k - dif[i] * j], j + 1));
      }
    }
    memset(dp[i & 1 ^ 1], 0, sizeof dp[i & 1 ^ 1]);
  }
  int ans = 0;
  for (int k = 0; k <= s; k++) sum(ans, dp[n & 1][0][k]);
  cout << ans << "\n";
  return 0;
}
