#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int dp[210][210][1010];
int n, v, a[510], ans;
void upd(int &a, long long b) { a = (a + b) % mod; }
int main() {
  scanf("%d%d", &n, &v);
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  sort(a, a + n);
  reverse(a, a + n);
  dp[0][0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < i + 1; j++)
      for (int k = 0; k < v + 1; k++)
        if (dp[i][j][k]) {
          int s = j * a[i] + k, ret = dp[i][j][k];
          if (j > 0 && s - a[i] - (j - 1) * a[i + 1] <= v)
            upd(dp[i + 1][j - 1][s - a[i] - (j - 1) * a[i + 1]],
                (long long)ret * j);
          if (s + a[i] - (j + 1) * a[i + 1] <= v)
            upd(dp[i + 1][j + 1][s + a[i] - (j + 1) * a[i + 1]], ret);
          if (s - j * a[i + 1] <= v)
            upd(dp[i + 1][j][s - j * a[i + 1]], (long long)ret * (j + 1));
        }
  for (int k = 0; k < v + 1; k++) upd(ans, dp[n][0][k]);
  printf("%d\n", ans);
}
