#include <bits/stdc++.h>
using namespace std;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)

#include <atcoder/modint>
using mint = atcoder::modint1000000007;

int main() {
    int N, mp, mq, L;
    cin >> N >> mp >> mq >> L;
    vector<int> S(N);
    for (auto &x : S) cin >> x;
    vector cnt(N + 1, vector<mint>(mq + 1));
    cnt[0][0] = 1;
    REP(k, N) {
        auto &s = S[k];
        IREP(i, k + 1) {
            mint cum = 0;
            REP(j, mq + 1) {
                cnt[i + 1][j] += cum, cum += cnt[i][j] - (j - s >= 0 ? cnt[i][j - s] : 0);
            }
        }
    }

    mint ret = 0;
    vector<mint> fac(N + mp + 1, 1), facinv(N + mp + 1);
    FOR(i, 1, fac.size()) fac[i] = fac[i - 1] * i;
    facinv.back() = 1 / fac.back();
    IREP(i, facinv.size() - 1) facinv[i] = facinv[i + 1] * (i + 1);

    REP(sz, cnt.size()) REP(i, cnt[sz].size()) {
        if (cnt[sz][i].val()) {
            int rem = mp - (sz * L - i);
            if (rem < 0) continue;
            ret += cnt[sz][i] * fac[rem + N - 1] * facinv[rem];
        }
    }
    cout << (ret / fac[N - 1]).val() << '\n';
}