#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
const int MOD = 1e9 + 7;
int n, k, a[N], dp[205][205][N];
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  dp[0][0][0] = 1;
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= i; j++) {
      for (int newk = 0; newk <= k; newk++) {
        int val = newk + j * (a[i] - a[i - 1]) % MOD;
        if (val > k) continue;
        int tmp = dp[i - 1][j][newk];
        dp[i][j][val] = (dp[i][j][val] + (long long)(j + 1) * tmp % MOD) % MOD;
        dp[i][j + 1][val] = (dp[i][j + 1][val] + tmp) % MOD;
        dp[i][j - 1][val] =
            (dp[i][j - 1][val] + (long long)j * tmp % MOD) % MOD;
      }
    }
  }
  int res = 0;
  for (int i = 0; i <= k; i++) {
    res = (res + dp[n][0][i]) % MOD;
  }
  cout << res;
}
