#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 1e9 + 7;

const int N = 1e2 + 10;
const int M = 1e3 + 10;
const int W = 1e3;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
void add(int &a, int b) { (a += b) >= P ? a -= P : 1; }
void sub(int &a, int b) { (a -= b) < 0 ? a += P : 1; }
int sgn(int x) { return x & 1 ? P - 1 : 1; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

int n, m, a[N], f[N][N][M][2][2], ans;

int main() {
  n = read(), m = read();
  rep(i, 1, n) a[i] = read();
  sort(a + 1, a + n + 1);
  f[0][0][0][0][0] = 1;
  rep(i, 0, n - 1) rep(j, 0, min(i, n - i + 1)) {
    rep(s, 0, m) rep(p, 0, 1) rep(q, 0, 1) {
      int cur = f[i][j][s][p][q], ns = s + (2 * j - p - q) * (a[i + 1] - a[i]);
      if (!cur || ns > m) continue; 
      if (!p) add(f[i + 1][j + 1][ns][1][q], cur);
      if (!q) add(f[i + 1][j + 1][ns][p][1], cur);
      add(f[i + 1][j + 1][ns][p][q], cur);
      if (!p) add(f[i + 1][j][ns][1][q], mul(cur, j - (i + 1 < n && q)));
      add(f[i + 1][j][ns][p][q], mul(cur, j - (i + 1 < n && q)));
      if (!q) add(f[i + 1][j][ns][p][1], mul(cur, j - (i + 1 < n && p)));
      add(f[i + 1][j][ns][p][q], mul(cur, j - (i + 1 < n && p)));
      if (j > 1) {
        int coef = (j - q) * (j - p) - (j - p - q) - (p && q && i + 1 < n);
        add(f[i + 1][j - 1][ns][p][q], mul(cur, coef));
      }
    }
  }
  rep(s, 0, m) add(ans, f[n][1][s][1][1]);
  printf("%d\n", ans);
  return 0;
}