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