# 行列の乗算(mod)
def mat_mul(a, b):
    I, K, J = len(a), len(b), len(b[0])
    c = [[0 for j in range(J)] for i in range(I)]
    for i in range(I):
        for k in range(K):
            for j in range(J):
                c[i][j] += a[i][k] * b[k][j]
                c[i][j] %= mod
    return c

# 行列の累乗(mod)
def mat_pow(a, n):
    b = [[0 for j in range(len(a))] for i in range(len(a))]
    for i in range(len(a)):
        b[i][i] = 1
    while n > 0:
        if n & 1:
            b = mat_mul(b, a)
        a = mat_mul(a, a)
        n >>= 1
    return b

n,w,K = map(int,input().split())
A = [int(i) for i in input().split()]

mod = 10**9+7

a = [[0]*(2*w+1) for i in range(2*w+1)]
aa = [[0]*(2*w+1) for i in range(2*w+1)]

aa[0][0] = 1

for i in range(2*w):
    for k in range(n):
        if i + A[k] <= 2*w:
            aa[i+A[k]][i+A[k]] += aa[i][i]
            aa[i+A[k]][i+A[k]] %= mod
        else:
            break

gr = mat_pow(aa,(K+1)//2)
ans = 0

for i in range(2*w+1):
    if K % 2 == 1:
        ans += gr[i][w]
    else:
        ans += gr[i][2*w]
    ans %= mod
print(ans)