#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) x.begin(),x.end()
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int n,m,k,a[14];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n>>m;
m++;
k=(1<<n);
vector<vector<vector<ll>>> dp(k,vector<vector<ll>>(n,vector<ll>(m,0)));
REP(i,0,n)cin>>a[i];
ll ans=0;
REP(i,0,n)dp[(1<<i)][i][0]=1;
REP(i,1,k)REP(j,0,n){
if((i&(1<<j))==0)continue;
REP(x,0,m){
if(dp[i][j][x]==0)continue;
REP(y,0,n)if(((i&(1<<y))==0)&&(x+abs(a[y]-a[j])<m)){
dp[(i|(1<<y))][y][x+abs(a[y]-a[j])]+=dp[i][j][x];
}
}
}
REP(i,0,n)REP(j,0,m)ans+=dp[k-1][i][j];
cout<<ans%M;
}
