#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int n, k, i, j, ii, a[205];
long long dp[2][205][1005];
int main() {
  scanf("%d%d", &n, &k);
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 1 + n);
  dp[0][0][0] = 1;
  for (i = 1; i <= n; i++) {
    for (j = 0; j <= n; j++) {
      for (ii = 0; ii <= k; ii++) {
        dp[i & 1][j][ii] = 0;
        if (ii - j * (a[i] - a[i - 1]) >= 0)
          dp[i & 1][j][ii] = (dp[i & 1][j][ii] +
                              dp[1 - (i & 1)][j][ii - j * (a[i] - a[i - 1])]) %
                             MOD;
        if (j - 1 >= 0 && ii - (j - 1) * (a[i] - a[i - 1]) >= 0)
          dp[i & 1][j][ii] =
              (dp[i & 1][j][ii] +
               dp[1 - (i & 1)][j - 1][ii - (j - 1) * (a[i] - a[i - 1])]) %
              MOD;
        if (ii - (j + 1) * (a[i] - a[i - 1]) >= 0)
          dp[i & 1][j][ii] =
              (dp[i & 1][j][ii] +
               dp[1 - (i & 1)][j + 1][ii - (j + 1) * (a[i] - a[i - 1])] *
                   (j + 1)) %
              MOD;
        if (ii - j * (a[i] - a[i - 1]) >= 0)
          dp[i & 1][j][ii] =
              (dp[i & 1][j][ii] +
               dp[1 - (i & 1)][j][ii - j * (a[i] - a[i - 1])] * j) %
              MOD;
      }
    }
  }
  long long ans = 0;
  for (i = 0; i <= k; i++) ans = (ans + dp[n & 1][0][i]) % MOD;
  printf("%lld\n", ans);
}
