def Berlekamp_Massey(A,mod):
    n = len(A)
    B, C = [1], [1]
    l, m, p = 0, 1, 1
    for i in range(n):
        d = A[i]
        for j in range(1, l + 1):
            d += C[j] * A[i - j]
            d %= mod
        if d == 0:
            m += 1
            continue
        T = C.copy()
        q = pow(p, mod - 2, mod) * d % mod
        if len(C) < len(B) + m:
            C += [0] * (len(B) + m - len(C))
        for j, b in enumerate(B):
            C[j + m] -= q * b
            C[j + m] %= mod
        if 2 * l <= i:
            B = T
            l, m, p = i + 1 - l, 1, d
        else:
            m += 1
    res = [-c % mod for c in C[1:]]
    return res

def BMBM(A,N,mod):
    deno=[1]+[-c for c in Berlekamp_Massey(A,mod)]
    nume=[0]*(len(deno)-1)
    for i in range(len(A)):
        for j in range(len(deno)):
            if i+j<len(nume):
                nume[i+j]+=A[i]*deno[j]
                nume[i+j]%=mod
    return Bostan_Mori(nume,deno,N,mod=mod)

def Bostan_Mori(poly_nume,poly_deno,N,mod=0,convolve=None):
    #if type(poly_nume)==Polynomial:
    #    poly_nume=poly_nume.polynomial
    #if type(poly_deno)==Polynomial:
    #    poly_deno=poly_deno.polynomial
    if convolve==None:
        def convolve(poly_nume,poly_deno):
            conv=[0]*(len(poly_nume)+len(poly_deno)-1)
            for i in range(len(poly_nume)):
                for j in range(len(poly_deno)):
                    x=poly_nume[i]*poly_deno[j]
                    if mod:
                        x%=mod
                    conv[i+j]+=x
            if mod:
                for i in range(len(conv)):
                    conv[i]%=mod
            return conv
    while N:
        poly_deno_=[-x if i%2 else x for i,x in enumerate(poly_deno)]
        if N%2:
            poly_nume=convolve(poly_nume,poly_deno_)[1::2]
        else:
            poly_nume=convolve(poly_nume,poly_deno_)[::2]
        poly_deno=convolve(poly_deno,poly_deno_)[::2]
        if mod:
            for i in range(len(poly_nume)):
                poly_nume[i]%=mod
            for i in range(len(poly_deno)):
                poly_deno[i]%=mod
        N//=2
    return poly_nume[0] if poly_nume else 0

N,W,K=map(int,input().split())
A=list(map(int,input().split()))
mod=10**9+7
dp=[0]*(2*W+1)
dp[0]=1
for w in range(2*W+1):
    for a in A:
        if w>=a:
            dp[w]+=dp[w-a]
            dp[w]%=mod
DP=[1,dp[W]]
for n in range(2,10):
    DP.append((DP[n-1]*dp[W]+DP[n-2]*(dp[2*W]-dp[W]**2))%mod)
ans=BMBM(DP,K,mod)
print(ans)