import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**19
# md = 998244353
md = 10**9+7

def nHr(hn, hr):
    return nCr(hn+hr-1, hr-1)

def nPr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_n-com_r]%md

def nCr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md

# 準備
n_max = 30000
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md

n, p, q, l = LI()
ss = LI()

# dp[i][j]...i人にj個のqを配った
dp = [[0]*(q+1) for _ in range(n+1)]
dp[0][0] = 1
for k, s in enumerate(ss):
    for i in range(k, -1, -1):
        v = 0
        for j in range(q):
            v += dp[i][j]
            if j-s >= 0: v -= dp[i][j-s]
            v %= md
            dp[i+1][j+1] += v
            dp[i+1][j+1] %= md
# p2D(dp)

ans = 0
for i in range(n+1):
    for j in range(q+1):
        c = dp[i][j]
        if c == 0: continue
        r = p-(i*l-j)
        ans += c*nCr(r+n-1, r)
        ans %= md
        # print(i,j,r,ans)

print(ans)