#include <bits/stdc++.h>
using namespace std;
long long n, k, a[201], dp[5][201][1001], ans = 0, mod = 1e9 + 7;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  dp[0][0][0] = 1;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j <= n; j++) {
      long long d = (a[i + 1] - a[i]) * j;
      for (long long l = 0; l <= k - d; l++) {
        dp[(i + 1) % 2][j][l + d] =
            (dp[(i + 1) % 2][j][l + d] + dp[i % 2][j][l] * (j + 1) % mod) % mod;
        if (j > 0)
          dp[(i + 1) % 2][j - 1][l + d] =
              (dp[(i + 1) % 2][j - 1][l + d] + dp[i % 2][j][l] * j % mod) % mod;
        if (j < n)
          dp[(i + 1) % 2][j + 1][l + d] =
              (dp[(i + 1) % 2][j + 1][l + d] + dp[i % 2][j][l]) % mod;
      }
    }
    for (long long j = 0; j <= n; j++)
      for (long long l = 0; l <= k; l++) dp[i % 2][j][l] = 0;
  }
  for (long long i = 0; i <= k; i++) ans = (ans + dp[n % 2][0][i]) % mod;
  cout << ans;
}
