#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
// 二項係数計算
long long COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

long long FINV(int n){
    if (n < 0) return 0;
    return finv[n];
}

int main() {
    COMinit();
    ll n, p, q, l;
    cin >> n >> p >> q >> l;
    ll s[n] = {};
    rep(i,n) cin >> s[i];

    ll dp[n+1][n+1][q+1];
    rep(i,n+1)rep(j,n+1)rep(k,q+1) dp[i][j][k] = 0;
    dp[0][0][0] = 1;

    rep(i,n){
        rep(j,n+1){
            rep(k,q+1){
                dp[i+1][j][k] = dp[i][j][k];
            }
        }
        rep(j,n){
            ll sum = 0;
            rep(k,q+1){
                dp[i+1][j+1][k] += sum;
                dp[i+1][j+1][k] %= MOD;
                sum += dp[i][j][k];
                if(k>=s[i]) sum += MOD - dp[i][j][k-s[i]];
                sum %= MOD;
            }
        }
    }

    ll ans = 0;


    rep(j,n+1){
        rep(k,q+1){
            int distributed = j*l - k;
            if(distributed > p) continue;
            ans += dp[n][j][k] * COM(p-distributed+(n-1), n-1) % MOD;
            ans %= MOD;
        }
    }

    cout << ans << endl;
    return 0;
}