N, MP, Mq, L = map(int, input().split())
S = list(map(int, input().split()))
MOD = 10 ** 9 + 7

dp = [[0] * (Mq + 1) for k in range(N + 1)]
dp[0][0] = 1

for i in range(N):
    s = S[i]
    for n in range(N - 1, -1, -1):
        for m in range(Mq + 1):
            if m + 1 <= Mq:
                dp[n + 1][m + 1] = (dp[n + 1][m + 1] + dp[n][m]) % MOD
            if m + s + 1 <= Mq:
                dp[n + 1][m + s + 1] = (dp[n + 1][m + s + 1] - dp[n][m]) % MOD
for n in range(N + 1):
    for i in range(n):
        for m in range(1, Mq + 1):
            dp[n][m] = (dp[n][m] + dp[n][m - 1]) % MOD

fac = [1] * (50000)
inv = [1] * (50000)
for i in range(1, 50000):
    fac[i] = (fac[i - 1] * i) % MOD
    inv[i] = pow(fac[i], MOD - 2, MOD)
def nCr(n, r):
    if n < r:
        return 0
    return (fac[n] * inv[n - r] * inv[r]) % MOD

ans = 0
for m in range(Mq + 1):
    for n in range(N + 1):
        ans = (ans + dp[n][m] * nCr(MP + m - L * n + N - 1, N - 1)) % MOD
print(ans)