#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int f[205][205][1005], n, a[205], K;
signed main() {
  scanf("%d%d", &n, &K);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + 1 + n);
  f[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= n; j++) {
      int temp = (a[i + 1] - a[i]) * j;
      for (int k = 0; k <= K - temp; k++) {
        (f[i + 1][j][k + temp] += (long long)(j + 1) * f[i][j][k] % mod) %= mod;
        if (j != n) (f[i + 1][j + 1][k + temp] += f[i][j][k]) %= mod;
        if (j != 0)
          (f[i + 1][j - 1][k + temp] += (long long)j * f[i][j][k] % mod) %= mod;
      }
    }
  }
  int ans = 0;
  for (int i = 0; i <= K; i++) {
    (ans += f[n][0][i]) %= mod;
  }
  printf("%d\n", ans);
  return 0;
}
