#include <bits/stdc++.h>
using namespace std;
int dp[201][201][1001], a[201];
int main() {
  int n, k, kk, i, j, l, newk, s;
  scanf("%d %d", &n, &kk);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + n + 1);
  dp[1][0][0] = 1;
  dp[1][1][0] = 1;
  for (i = 2; i <= n; i++) {
    s = 0;
    if (i > 1) {
      s = a[i] - a[i - 1];
    }
    for (j = 0; j < i; j++) {
      for (l = 0; l <= kk; l++) {
        newk = l + j * s;
        if (newk <= kk) {
          dp[i][j][newk] += ((long long)dp[i - 1][j][l] * (j + 1)) % 1000000007;
          if (dp[i][j][newk] >= 1000000007) {
            dp[i][j][newk] %= 1000000007;
          }
          dp[i][j - 1][newk] += ((long long)dp[i - 1][j][l] * j) % 1000000007;
          if (dp[i][j - 1][newk] >= 1000000007) {
            dp[i][j - 1][newk] %= 1000000007;
          }
          dp[i][j + 1][newk] += dp[i - 1][j][l];
          if (dp[i][j + 1][newk] >= 1000000007) {
            dp[i][j + 1][newk] %= 1000000007;
          }
        } else {
          break;
        }
      }
    }
  }
  long long ans = 0;
  for (i = 0; i <= kk; i++) {
    ans += dp[n][0][i];
    if (ans >= 1000000007) {
      ans %= 1000000007;
    }
  }
  printf("%lld\n", ans);
  return 0;
}
