#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
struct modinv {
  int n; vector<mint> d;
  modinv(): n(2), d({0,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(-d[mint::mod()%n]*(mint::mod()/n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} invs;
struct modfact {
  int n; vector<mint> d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*n), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} facts;
struct modfactinv {
  int n; vector<mint> d;
  modfactinv(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*invs(n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} ifacts;
mint comb(int n, int k) {
  if (n < k || k < 0) return 0;
  return facts(n)*ifacts(k)*ifacts(n-k);
} 
int main(){
  int n,ma,mb,l;cin>>n>>ma>>mb>>l;
  vc<int>v(n); rep(i,n)cin>>v[i];
  vc dp(n+1,vc<mint>(mb+1,0)); dp[0][0]=1;
  rep(i,n){
    auto pre=dp;
    rep(j,n+1)rep(k,mb)pre[j][k+1]+=pre[j][k];
    rep(j,n)for(int k=1;k<=mb;k++){
      dp[j+1][k]+=pre[j][k-1];
      if(k-v[i]-1>=0)dp[j+1][k]-=pre[j][k-v[i]-1];
    }
  }
  mint ans=0;
  //rep(i,3)cout<<dp[i][mb].val()<<' ';
  rep(j,n+1)rep(k,mb+1){
    int r=j*l-k;
    r=ma-r;
    if(r<0)continue;
    ans+=dp[j][k]*comb(r+n-1,n-1);
  }
  cout<<ans.val();
}