#include <bits/stdc++.h>
using namespace std;
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
int dx[] = {0, 0, 1, -1};
int dy[] = {-1, 1, 0, 0};
long long dp[3][301][5001];
int ara[1001], n;
long long dp_func(int pos, int gr, int ase, int bol) {
  if (ase < 0 || gr < 0) return 0;
  return dp[bol ^ 1][gr][ase];
}
int main() {
  int i, j, k, l, m;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &ara[i]);
  sort(ara + 1, ara + n + 1);
  for (int i = 0; i < 1; i++) {
    for (int j = 0; j <= k; j++) {
      dp[0][0][0] = 1;
    }
  }
  int bol = 1;
  for (int i = n; i >= 1; i--) {
    for (int gr = 0; gr <= n; gr++) {
      for (int ase = 0; ase <= k; ase++) {
        int add = gr * (ara[i] - ara[i - 1]);
        long long ret = 0;
        int pos = i;
        ret += dp_func(pos + 1, gr, ase - add, bol) * gr;
        ret += dp_func(pos + 1, gr - 1, ase - add, bol) * gr;
        ret += dp_func(pos + 1, gr, ase - add, bol);
        ret += dp_func(pos + 1, gr + 1, ase - add, bol);
        ret %= 1000000007;
        dp[bol][gr][ase] = ret;
      }
    }
    bol ^= 1;
  }
  long long ans = 0;
  for (int i = 0; i <= k; i++) {
    ans += dp[bol ^ 1][0][i];
  }
  printf("%lld\n", ans % 1000000007);
}
