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