#include <bits/stdc++.h>
using namespace std;
const int NR = 205;
const int MR = 1005;
const int mod = 1e9 + 7;
void Max(int& x, int y) { x = max(x, y); }
void Min(int& x, int y) { x = min(x, y); }
void Add(int& x, int y) { x = (x + y) % mod; }
int n, m;
int a[NR];
int dp[NR][NR][MR];
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int main() {
  n = read(), m = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  sort(a + 1, a + n + 1);
  dp[1][0][0] = 1;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      int t = (a[i] - a[i - 1]) * j;
      for (int k = 0; k <= m - t; k++) {
        Add(dp[i + 1][j][k + t], 1ll * dp[i][j][k] * (j + 1) % mod);
        if (j != n) Add(dp[i + 1][j + 1][k + t], dp[i][j][k]);
        if (j != 0) Add(dp[i + 1][j - 1][k + t], 1ll * dp[i][j][k] * j % mod);
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= m; i++) Add(ans, dp[n + 1][0][i]);
  printf("%d\n", ans);
  return 0;
}
