n, w, k = map(int, input().split())
A = list(map(int, input().split()))
mod = 10**9+7

dp1 = [0]*(w+1)
dp2 = [0]*(2*w+1)

dp1[0] = 1
for i in range(1, w+1):
    for j in range(n):
        if i-A[j] >= 0:
            dp1[i] += dp1[i-A[j]]
            dp1[i] %= mod

dp2[0] = 1
for i in range(1, 2*w+1):
    if i == w:
        continue
    for j in range(n):
        if i-A[j] >= 0:
            dp2[i] += dp2[i-A[j]]
            dp2[i] %= mod

# A*B
def mul(a, b):
    c = [[0]*len(b[0]) for i in range(len(a))]
    for i in range(len(a)):
        for k in range(len(b)):
            for j in range(len(b[0])):
                c[i][j] = (c[i][j] + a[i][k]*b[k][j])%mod

    return c

#A**n
def pow(a, n):
    b = [[0]*len(a) for i in range(len(a))]
    for i in range(len(a)):
        b[i][i] = 1
    while n > 0:
        if n & 1 == 1:
            b = mul(a, b)
        a = mul(a, a)
        n = n>>1
    return b

X = [[dp1[-1], dp2[-1]], [1, 0]]
Y =  pow(X, k)
ans = Y[1][0]*dp1[-1]+Y[1][1]*1
print(ans%mod)