#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
x += k;
x %= mod;
if (x < 0)
x += mod;
}
void del(int &x, int k)
{
x -= k;
x %= mod;
if (x < 0)
x += mod;
}
int n, l, a[105];
int f[105][105][1111][3];
main()
{
#define name "TASK"
if (fopen(name ".inp", "r"))
{
freopen(name ".inp", "r", stdin);
freopen(name ".out", "w", stdout);
}
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> l;
fo(i, 1, n) cin >> a[i];
f[0][0][0][0] = 1;
sort(a + 1, a + n + 1);
a[n + 1] = 10000;
fo(i, 1, n) fo(j, 1, i) fo(k, 0, l) fo(m, 0, min(2ll, i))
{
int delta = (2 * j - m) * (a[i + 1] - a[i]);
if (k < delta)
continue;
add(f[i][j][k][m], f[i - 1][j - 1][k - delta][m]);
if (m)
{
add(f[i][j][k][m], (2 - (m - 1)) * f[i - 1][j - 1][k - delta][m - 1]);
}
add(f[i][j][k][m], (2 * j - m) * f[i - 1][j][k - delta][m]);
if (m == 1)
add(f[i][j][k][m], 2 * j * f[i - 1][j][k - delta][m - 1]);
if (m == 2)
{
if(i == n) add(f[i][j][k][m],f[i - 1][j][k - delta][m - 1]);
else if(j > 1)
add(f[i][j][k][m], (j - 1) * f[i - 1][j][k - delta][m - 1]);
}
if (m == 2)
{
if(i == n) add(f[i][j][k][m],f[i - 1][j + 1][k - delta][m]);
else add(f[i][j][k][m],j * (j - 1) * f[i - 1][j + 1][k - delta][m]);
}
else if(m == 1) add(f[i][j][k][m],j * j * f[i - 1][j + 1][k - delta][m]);
else add(f[i][j][k][m],j * (j + 1) * f[i - 1][j + 1][k - delta][m]);
}
int ans = 0;
fo(i,0,l) add(ans,f[n][1][i][2]);
cout << ans;
}
