#include <bits/stdc++.h>
using namespace std;
long long rdtsc() {
  long long tmp;
  asm("rdtsc" : "=A"(tmp));
  return tmp;
}
inline int myrand() { return abs((rand() << 15) ^ rand()); }
inline int rnd(int x) { return myrand() % x; }
void precalc() {}
const int maxk = 1010;
const int maxn = 210;
const int mod = (int)1e9 + 7;
void add(int& a, int b) {
  if ((a += b) >= mod) {
    a -= mod;
  }
}
int prod(int a, int b) { return (long long)a * b % mod; }
int n, k;
int a[maxn];
bool read() {
  if (scanf("%d%d", &n, &k) < 2) {
    return false;
  }
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  return true;
}
int dp[maxn][maxn][maxk];
void solve() {
  sort(a, a + n);
  memset(dp, 0, sizeof(dp));
  dp[0][0][0] = 1;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j <= i; ++j) {
      for (int c = 0; c <= k; ++c) {
        if (dp[i][j][c] == 0) {
          continue;
        }
        if (i < n - 1) {
          int nc = c + (j + 1) * (a[i + 1] - a[i]);
          if (nc <= k) {
            add(dp[i + 1][j + 1][nc], dp[i][j][c]);
          }
        }
        if (i < n - 1 || j == 0) {
          int nc = (i == n - 1 ? c : c + j * (a[i + 1] - a[i]));
          if (nc <= k) {
            add(dp[i + 1][j][nc], dp[i][j][c]);
            if (j > 0) {
              add(dp[i + 1][j][nc], prod(j, dp[i][j][c]));
            }
          }
        }
        if (j > 0 && (i < n - 1 || j == 1)) {
          int nc = (i == n - 1 ? c : c + (j - 1) * (a[i + 1] - a[i]));
          if (nc <= k) {
            add(dp[i + 1][j - 1][nc], prod(j, dp[i][j][c]));
          }
        }
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= k; ++i) {
    add(ans, dp[n][0][i]);
  }
  printf("%d\n", ans);
}
int main() {
  srand(rdtsc());
  precalc();
  while (true) {
    if (!read()) {
      break;
    }
    solve();
  }
  return 0;
}
