#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int MOD = 1000000007;
int dp[105][105][1005][3];
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin>>n>>k;
if (n==1){
cout<<1;
return 0;
}
vector<int> vect(n+2, 2005);
for (int i=1; i<=n; ++i)cin>>vect[i];
sort(vect.begin()+1, vect.end());
dp[0][0][0][0]=1;
for (int i=1; i<=n; ++i)for (int j=1; j<=i; ++j)for (int l=0; l<=k; ++l)for (int p=0; p<3; ++p){
int d=(2*j-p)*(vect[i+1]-vect[i]);
if (d>k||i+j+1-p>n)continue;
dp[i][j][l][p]=(dp[i][j][l][p]+dp[i-1][j-1][l-d][p])%MOD;
if (p)dp[i][j][l][p]=(dp[i][j][l][p]+(3-p)*dp[i-1][j-1][l-d][p-1])%MOD;
dp[i][j][l][p]=(dp[i][j][l][p]+(2*j-p)*dp[i-1][j][l-d][p])%MOD;
if (p==1)dp[i][j][l][p]=(dp[i][j][l][p]+2*j*dp[i-1][j][l-d][p-1])%MOD;
else if (p){
if (i==n)dp[i][j][l][p]=(dp[i][j][l][p]+dp[i-1][j][l-d][p-1])%MOD;
else if (j>1)dp[i][j][l][p]=(dp[i][j][l][p]+(j-1)*dp[i-1][j][l-d][p-1])%MOD;
}
if (!p)dp[i][j][l][p]=(dp[i][j][l][p]+j*(j+1)*dp[i-1][j+1][l-d][p])%MOD;
else if (p==1)dp[i][j][l][p]=(dp[i][j][l][p]+j*j*dp[i-1][j+1][l-d][p])%MOD;
else if (i==n)dp[i][j][l][p]=(dp[i][j][l][p]+dp[i-1][j+1][l-d][p])%MOD;
else dp[i][j][l][p]=(dp[i][j][l][p]+j*(j-1)*dp[i-1][j+1][l-d][p])%MOD;
}
int ans=0;
for (int i=0; i<=k; ++i)ans=(ans+dp[n][1][i][2])%MOD;
cout<<ans;
}
