#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=1100;
const int M=5001;
const int B=447;
const int mod=1e9+7;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
int n,L;
int a[N];
void solve1(){
sort(a+1,a+n+1);
int cnt=1;
for(int i=1;i<=n;i++){
cnt=(cnt*i);
}
int ans=0;
while(cnt--){
int res=0;
for(int i=2;i<=n;i++){
res+=abs(a[i]-a[i-1]);
}
if(res<=L){
ans++;
}
next_permutation(a+1,a+n+1);
}
cout<<ans<<'\n';
}
int last[(1<<14)][14][101];
void solve2(){
sort(a+1,a+n+1);
int ans=0;
for(int i=0;i<n;i++){
last[(1<<i)][i][0]=1;
}
for(int mask=0;mask<(1<<n);mask++){
for(int i=0;i<n;i++){
if((mask>>i)&1ll){
for(int j=0;j<n;j++){
if((mask>>j)&1ll)continue;
int ad=abs(a[j+1]-a[i+1]);
for(int w=0;w+ad<=L;w++){
last[mask^(1<<j)][j][w+ad]=(last[mask^(1<<j)][j][w+ad]+last[mask][i][w])%mod;
}
}
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<=L;j++){
ans=(ans+last[(1<<n)-1][i][j]);
}
}
cout<<ans<<'\n';
}
void test(){
cin>>n>>L;
for(int i=1;i<=n;i++){
cin>>a[i];
}
if(n<=8){
solve1();
return;
}
if(n<=14&&L<=100){
solve2();
return;
}
}
/*
*/
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// cout.tie(nullptr);
int t2=1;
// cin>>t2;
for(int i=1;i<=t2;i++){
test();
}
}
