#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const ll inf=1e9+7;
const ll INF=1e18;
const ll mod=99824453;

int main(){
    int n,k;cin>>n>>k;
    vin a(n);rep(i,n)cin>>a[i];
    vector<vector<vector<ll>>> dp(2, vector<vector<ll>>(n+1, vector<ll>(100*n+1)));//dp[i+1][j][l]:a[i]までの中からj人選んで点数の総和をlにする通り数
    dp[0][0][0]=(ll)1;
    rep(i,n)rep(j,i+2)rep(l,100*(i+1)+1){
        dp[(i+1)%2][j][l]=dp[i%2][j][l];
        if(j>0&&l>=a[i]){
            dp[(i+1)%2][j][l]+=dp[i%2][j-1][l-a[i]];
            dp[(i+1)%2][j][l]%=inf;
        }
    }
    ll ans=(ll)0;
    rep2(i,1,n+1)rep2(j,k*i,100*i+1){
        ans+=dp[n%2][i][j];
        ans%=inf;
    }
    cout<<ans<<endl;
}