#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void add(long long& a, long long b) {
  a += b;
  if (a >= mod) {
    a -= mod;
  }
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
  }
  sort((v).begin(), (v).end());
  vector<vector<long long> > dp1(n, vector<long long>(k + 1));
  vector<vector<long long> > dp2(n, vector<long long>(k + 1));
  if (n >= 2) {
    dp1[1][0] = 1;
  }
  dp1[0][0] = 1;
  for (int i = 0; i < n - 1; ++i) {
    for (int g = 0; g < n; ++g) {
      for (int s = 0; s <= k; ++s) {
        int t = g * (v[i + 1] - v[i]);
        if (s + t > k) {
          continue;
        }
        add(dp2[g][s + t], dp1[g][s]);
        if (g < n - 1) {
          add(dp2[g + 1][s + t], dp1[g][s]);
        }
        if (g) {
          add(dp2[g - 1][s + t], (dp1[g][s] * (long long)(g)) % mod);
          add(dp2[g][s + t], (dp1[g][s] * (long long)(g)) % mod);
        }
      }
    }
    dp1.swap(dp2);
    for (int g = 0; g < n; ++g) {
      dp2[g].assign(k + 1, 0);
    }
  }
  long long ans = 0;
  for (int s = 0; s <= k; ++s) {
    add(ans, dp1[0][s]);
  }
  cout << ans << "\n";
}
