#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int mod = 1e9 + 7;
const int IMAX = 100000;
constexpr ll modpow(ll A, ll B) {
	ll kotae = 1;
	while (B > 0) {
		if (B & 1) kotae = kotae * A % mod;
		A = A * A % mod;
		B >>= 1;
	}
	return kotae;
}
class unko {
public:
	int fac[IMAX + 1], ifac[IMAX + 1], inv[IMAX + 1];
	constexpr unko() : fac(), ifac(), inv() {
		fac[0] = 1;
		rep1(i, IMAX) fac[i] = ll(fac[i - 1]) * i % mod;
		ifac[IMAX] = modpow(fac[IMAX], mod - 2);
		for (int i = IMAX; i > 0; i--) ifac[i - 1] = ll(ifac[i]) * i % mod;
		inv[0] = 1;
		rep1(i, IMAX) inv[i] = ll(ifac[i]) * fac[i - 1] % mod;
	}
	int comb(int A, int B) {
		return ll(fac[A]) * ifac[B] % mod * ifac[A - B] % mod;
	}
} f;

ll dp[50][40100];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, P, Q, L;
	cin >> N >> P >> Q >> L;

	int S[40];
	rep(i, N) cin >> S[i];

	dp[0][0] = 1;
	rep(i, N) {
		for (int j = i; j >= 0; j--) {
			ll tmp = 0;

			for (int k = Q; k >= 0; k--) {
				tmp += dp[j][k] - dp[j][k + S[i]];

				tmp %= mod;
				if (k + S[i] <= Q) (dp[j + 1][k + S[i]] += tmp) %= mod;
			}
			for (int k = -1; k + S[i] >= 0; k--) {
				tmp += - dp[j][k + S[i]];

				tmp %= mod;
				if (k + S[i] <= Q) (dp[j + 1][k + S[i]] += tmp) %= mod;
			}
		}
	}




	ll kotae = 0;
	rep(j, N + 1) rep(k, Q + 1) {
		int tmp = P - j * L + k;

		if (tmp >= 0) {
			kotae += f.comb(N + tmp - 1, tmp) * dp[j][k] % mod;
		}
	}
	co((kotae % mod + mod) % mod);

	Would you please return 0;
}