#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0;
  char ch = getchar();
  bool f = 0;
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = 1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  return f ? -x : x;
}
void write(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar(x % 10 + '0');
}
void writeln(long long x) {
  write(x);
  puts("");
}
void writep(long long x) {
  write(x);
  putchar(' ');
}
int const N = 200 + 3;
int const M = 1000 + 3;
int const Mo = 1e9 + 7;
int n, m, a[N], f[N][N][M];
signed main() {
  n = read();
  m = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  sort(a + 1, a + n + 1);
  f[0][0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= i; j++) {
      int add = (a[i + 1] - a[i]) * j;
      for (int k = 0; k + add <= m; k++) {
        f[i + 1][j + 1][k + add] = (f[i + 1][j + 1][k + add] + f[i][j][k]) % Mo;
        f[i + 1][j][k + add] = (f[i + 1][j][k + add] + f[i][j][k]) % Mo;
        f[i + 1][j][k + add] =
            (f[i + 1][j][k + add] + 1LL * j * f[i][j][k] % Mo) % Mo;
        if (j)
          f[i + 1][j - 1][k + add] =
              (f[i + 1][j - 1][k + add] + 1LL * j * f[i][j][k] % Mo) % Mo;
      }
    }
  int ans = 0;
  for (int i = 0; i <= m; i++) ans = (ans + f[n][0][i]) % Mo;
  writeln(ans);
  return 0;
}
