#include <bits/stdc++.h>
using namespace std;
int n, K;
const int mod = 1e9 + 7;
int a[222], f[2][222][1111], cur;
int main() {
  scanf("%d%d", &n, &K);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 1 + n);
  cur = 0;
  f[0][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= n; j++)
      for (int k = 0, tmp = j * (a[i] - a[i - 1]), to = K - tmp; k <= to;
           k++, tmp++)
        if (f[cur][j][k]) {
          f[cur ^ 1][j + 1][tmp] += f[cur][j][k];
          f[cur ^ 1][j + 1][tmp] -= f[cur ^ 1][j + 1][tmp] >= mod ? mod : 0;
          f[cur ^ 1][j][tmp] += (j + 1) * 1ll * f[cur][j][k] % mod;
          f[cur ^ 1][j][tmp] -= f[cur ^ 1][j][tmp] >= mod ? mod : 0;
          if (j > 0) {
            f[cur ^ 1][j - 1][tmp] += j * 1ll * f[cur][j][k] % mod;
            f[cur ^ 1][j - 1][tmp] -= f[cur ^ 1][j - 1][tmp] >= mod ? mod : 0;
          }
        }
    memset(f[cur], 0, sizeof(f[cur]));
    cur ^= 1;
  }
  int ans = 0;
  for (int i = 0; i <= K; i++) ans += f[cur][0][i], ans -= ans >= mod ? mod : 0;
  printf("%d\n", ans);
  return 0;
}
