#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
struct combination {
	vector<mint> fact, ifact;
	combination(int n) :fact(n + 1), ifact(n + 1) {
		assert(n < mod);
		fact[0] = 1;
		for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
		ifact[n] = fact[n].inv();
		for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
	}
	mint operator()(int n, int k) {
		return com(n, k);
	}
	mint com(int n, int k) {
		//if (n < 0) return com(-n, k) * (k % 2 ? -1 : 1);
		if (k < 0 || k > n) return 0;
		return fact[n] * ifact[k] * ifact[n - k];
	}
	mint inv(int n, int k) {
		//if (n < 0) return inv(-n, k) * (k % 2 ? -1 : 1);
		if (k < 0 || k > n) return 0;
		return ifact[n] * fact[k] * fact[n - k];
	}
}c(100000);
mint dp[42][42][20005];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, mp, mq, l;
	cin >> n >> mp >> mq >> l;
	vector<int>s(n);
	rep(i, n) { cin >> s[i]; }
	/*
		ΣΣf(m,n) * c((mp + m - nl + n - 1),n - 1)
	*/
	//前計算
	dp[0][0][0] = 1;
	rep(i, n) {
		rep(j, n + 1) {
			rep(k, mq + 1) {
				dp[i + 1][j][k] += dp[i][j][k];
				dp[i + 1][j][k + 1] -= dp[i][j][k];
				dp[i + 1][j + 1][k + 1] += dp[i][j][k];
				dp[i + 1][j + 1][min(mq + 1, k + s[i] + 1)] -= dp[i][j][k];
			}
		}
		//累積和
		rep(j, n + 1) {
			rep(k, mq + 1) {
				dp[i + 1][j][k + 1] += dp[i + 1][j][k];
			}
		}
	}
	mint ans = 0;
	rep(i, mq + 1) {
		rep(j, n + 1) {
			ans += dp[n][j][i] * c(mp + i - j * l + n - 1, n - 1);
		}
	}
	cout << ans.val() << endl;
	return 0;
}