#include <bits/stdc++.h>
using namespace std;

#define MOD 1000000007

vector<long> fac(50000, 1);

long modpow(long x, long p, long mod){
    long ret = 1;
    while (p > 0){
        if (p & 1) ret = (ret * x) % mod;
        x = (x * x) % mod;
        p >>= 1;
    }
    return ret;
}

long nCr(long n, long r){
    if (n < r) return 0;
    return (((fac[n] * modpow(fac[n - r], MOD - 2, MOD)) % MOD) * modpow(fac[r], MOD - 2, MOD)) % MOD;
}

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

    int N, MP, Mq, L;
    cin >> N >> MP >> Mq >> L;
    vector<int> S(N);
    for (int i = 0; i < N; i++){
        cin >> S[i];
    }

    vector<vector<long>> dp(N + 1, vector<long>(Mq + 1, 0));
    dp[0][Mq] = 1;
    for (int i = 1; i <= min(S[0], Mq); i++){
        dp[1][Mq - i] = 1;
    }

    for (int i = 1; i < N; i++){
        for (int k = N; k >= 1; k--){
            long sum = 0;
            for (int r = Mq; r >= 0; r--){
                dp[k][r] = (dp[k][r] + sum) % MOD;
                sum = (sum + dp[k - 1][r]) % MOD;
                if (r + S[i] <= Mq) sum = (sum - dp[k - 1][r + S[i]] + MOD) % MOD;
            }
        }
    }

    for (int i = 1; i < 50000; i++){
        fac[i] = (fac[i - 1] * i) % MOD;
    }

    long ans = 0;
    for (int m = 0; m <= Mq; m++){
        for (int x = 0; x <= N; x++){
            ans = (ans + dp[x][Mq - m] * nCr(MP + m - L * x + N - 1, N - 1)) % MOD;
        }
    }

    cout << ans << endl;
}