#include <bits/stdc++.h>
using namespace std;
long long n, k;
int32_t dp[208][208][1010], arr[208];
long long recursivecall(long long i, long long car, long long x) {
  if (dp[i][car][x] != -1) return dp[i][car][x];
  if (i == n) return (!car && x <= k);
  long long ret = 0;
  long long cst = i ? (arr[i] - arr[i - 1]) * car : arr[i] * car;
  if (x + cst <= k) {
    ret += recursivecall(i + 1, car, x + cst);
    ret %= 1000000007;
    if (car) ret += (car * recursivecall(i + 1, car, x + cst)) % 1000000007;
    if (car) ret += (car * recursivecall(i + 1, car - 1, x + cst)) % 1000000007;
    ret += recursivecall(i + 1, car + 1, x + cst);
    ret %= 1000000007;
  }
  return dp[i][car][x] = ret;
}
void solve() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  memset(dp, -1, sizeof dp);
  cout << recursivecall(0, 0, 0) << endl;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
