#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};

int main(){
	
	int N,Mp,Mq,L;
	cin>>N>>Mp>>Mq>>L;
	
	vector<int> S(N);
	rep(i,N){
		cin>>S[i];
	}
	
	vector dp(N+1,vector<mint>(Mq+1,0));
	dp[0][0] = 1;
	
	rep(i,N){
		
		rep(j,N+1){
			rep(k,Mq){
				dp[j][k+1] += dp[j][k];
			}
		}
		
		vector ndp(N+1,vector<mint>(Mq+1,0));
		rep(j,N+1){
			rep(k,Mq+1){
				ndp[j][k] += dp[j][k];
				if(k!=0)ndp[j][k] -= dp[j][k-1];
				
				if(j!=0 && k!=0){
					ndp[j][k] += dp[j-1][k-1];
					if(k-1-S[i]>=0){
						ndp[j][k] -= dp[j-1][k-1-S[i]];
					}
				}
				
			}
		}
		swap(dp,ndp);
		
	}
	
	combi C(1000000);
	mint ans = 0;
	rep(i,N+1){
		mint t = 0;
		rep(j,Mq+1){
			t = dp[i][j];
			if(Mp-L*i+j>=0){
				t *= C.junretsu(N-1,Mp-L*i+j);
				ans += t;
			}
		}
	}
	
	cout<<ans.val()<<endl;
	
    return 0;
}