#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (!b)
    return a;
  else
    return gcd(b, a % b);
}
int dp[200][201][1001];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      for (int kk = 0; kk <= k; kk++) {
        dp[i][j][kk] = 0;
      }
    }
  }
  sort(a.begin(), a.end());
  dp[0][1][0] = 1;
  dp[0][0][0] = 1;
  for (int i = 1; i < n; i++) {
    for (long long int j = 0; j <= i + 1; j++) {
      for (int kk = 0; kk <= k; kk++) {
        if (kk >= (j + 1) * (a[i] - a[i - 1]))
          dp[i][j][kk] +=
              (long long int)(dp[i - 1][j + 1]
                                [kk - (j + 1) * (a[i] - a[i - 1])]) *
              (j + 1) % (long long int)(1e9 + 7);
        dp[i][j][kk] %= (long long int)(1e9 + 7);
        if (j && kk >= (j - 1) * (a[i] - a[i - 1]))
          dp[i][j][kk] += dp[i - 1][j - 1][kk - (j - 1) * (a[i] - a[i - 1])];
        dp[i][j][kk] %= (long long int)(1e9 + 7);
        if (kk >= j * (a[i] - a[i - 1]))
          dp[i][j][kk] += dp[i - 1][j][kk - j * (a[i] - a[i - 1])];
        dp[i][j][kk] %= (long long int)(1e9 + 7);
        if (kk >= j * (a[i] - a[i - 1]))
          dp[i][j][kk] +=
              (long long int)(dp[i - 1][j][kk - j * (a[i] - a[i - 1])]) * j %
              (long long int)(1e9 + 7);
        dp[i][j][kk] %= (long long int)(1e9 + 7);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= k; i++) {
    ans += dp[n - 1][0][i];
    ans %= (long long int)(1e9 + 7);
  }
  cout << ans;
}
