#include <bits/stdc++.h>
using namespace std;
long long n, m;
long long dp[3][210][1100];
long long a[210];
int main() {
  while (scanf("%I64d%I64d", &n, &m) != EOF) {
    for (int i = 1; i <= n; i++) {
      scanf("%I64d", &a[i]);
    }
    sort(a + 1, a + n + 1);
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j <= i + 2; j++) {
        for (int k = 0; k <= m; k++) {
          dp[(i + 1) % 2][j][k] = 0;
        }
      }
      for (int j = 0; j <= i + 1; j++) {
        for (int k = 0; k <= m; k++) {
          if ((k + j * (a[i + 1] - a[i])) <= m) {
            dp[(i + 1) % 2][j][k + j * (a[i + 1] - a[i])] += dp[i % 2][j][k];
            dp[(i + 1) % 2][j + 1][k + j * (a[i + 1] - a[i])] +=
                dp[i % 2][j][k];
            if (j >= 1) {
              dp[(i + 1) % 2][j][k + j * (a[i + 1] - a[i])] +=
                  (j * dp[i % 2][j][k]);
              dp[(i + 1) % 2][j - 1][k + j * (a[i + 1] - a[i])] +=
                  (j * dp[i % 2][j][k]);
              dp[(i + 1) % 2][j - 1][k + j * (a[i + 1] - a[i])] %= 1000000007;
            }
            dp[(i + 1) % 2][j][k + j * (a[i + 1] - a[i])] %= 1000000007;
            dp[(i + 1) % 2][j + 1][k + j * (a[i + 1] - a[i])] %= 1000000007;
          }
        }
      }
    }
    long long ans = 0;
    for (int i = 0; i <= m; i++) {
      ans += dp[n % 2][0][i];
      ans %= 1000000007;
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
