#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=105,mod=1e9+7;
int n,k,f[N][N][N][2][2],a[N];

void upd(int i,int j,int p,int x,int y,int val) {
  int xp=p+(2*j-x-y)*(a[i]-a[i+1]); if(xp>k) return; if(val<=0) return;
  f[i][j][xp][x][y]=(f[i][j][xp][x][y]+val)%mod;
}

signed main() {
  n=read(), k=read();
  if(n==1) return puts("1"), 0;
  rep(i,1,n) a[i]=read();
  f[0][0][0][0][0]=1;
  sort(a+1,a+n+1,greater<int>());
  rep(i,1,n) {
    rep(j,0,i) {
      rep(p,0,k) {
        rep(x,0,1) rep(y,0,1) {
          int v=f[i-1][j][p][x][y];
          if(j&&!x) upd(i,j,p,1,y,v);
          if(!x) upd(i,j+1,p,1,y,v);
          if(j&&!y) upd(i,j,p,x,1,v);
          if(!y) upd(i,j+1,p,x,1,v);
          upd(i,j,p,x,y,v*(2*j-x-y)%mod);
          upd(i,j+1,p,x,y,v*(j+1-x-y)%mod);
          upd(i,j-1,p,x,y,v*(j-1)%mod);
        }
      }
    }
  }
  int ans=0;
  rep(p,0,k) ans=(ans+f[n][1][p][1][1])%mod;
  printf("%lld\n",ans);
  return 0;
}