# coding: utf-8
# Your code here!

import sys
readline = sys.stdin.readline
read = sys.stdin.read

#n,*a = [int(i) for i in read().split()]
#a = [int(i) for i in readline().split()]
#n = int(input())

MOD=10**9+7

def matmul(A,B,mod): # A,B: 行列
    res = [[0]*len(B[0]) for _ in [None]*len(A)]
    for i, resi in enumerate(res):
        for k, aik in enumerate(A[i]):
            for j,bkj in enumerate(B[k]):
                resi[j] += aik*bkj
                resi[j] %= mod
    return res

def matpow(A,p,M): #A^p mod M
    if p%2:
        return matmul(A, matpow(A,p-1,M), M)
    elif p > 0:
        b = matpow(A,p//2,M)
        return matmul(b,b,M)
    else:
        return [[1 if i == j else 0 for j in range(len(A))] for i in range(len(A))]




n,w,k,*a = [int(i) for i in read().split()]

c = 2*w+1
dp = [0]*c
dp[0] = 1
for i in range(c):
    for ai in a:
        if i+ai >= c: continue
        dp[i+ai] += dp[i]

#print(dp)

y = dp[w]
x = dp[2*w]-y*y

mat = [[0,1],[x,y]]
A = matpow(mat,k,MOD)

print(A[1][1]%MOD)

#print(A)