MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from collections import deque

class Matrix(list):

    def mul(self,B,mod = 0):
        C = Matrix([[0] * len(B[0]) for _ in range(len(self))])
        if mod == 0:
            for i in range(len(self)):
                for k in range(len(B)):
                    for j in range(len(B[0])):
                        C[i][j] += self[i][k] * B[k][j]
            
            return C
        else:
            for i in range(len(self)):
                for k in range(len(B)):
                    for j in range(len(B[0])):
                        C[i][j] = (C[i][j] + self[i][k] * B[k][j]) % mod
            
            return C

    
    def pow(self,n,mod = 0):
        if len(self) != len(self[0]):
            raise ValueError('the size of matrix is not different')

        if mod == 0:
            B = Matrix([[0] * len(self) for _ in range(len(self))])
            A = self
            for i in range(len(self)):
                B[i][i] = 1
            
            while n > 0:
                if (n&1):
                    B = B.mul(A)
                A = A.mul(A)
                n //= 2
            
            return B

        else:
            B = Matrix([[0] * len(self) for _ in range(len(self))])
            A = self
            for i in range(len(self)):
                B[i][i] = 1
            
            while n > 0:
                if (n&1):
                    B = B.mul(A,mod)
                A = A.mul(A,mod)
                n //= 2
            
            return B

def main():
    n,w,k = map(int,input().split())
    a = list(map(int,input().split()))

    dp = [0] * (2 * w + 1)
    dp[0] = 1
    for i in range(w):
        for j in range(n):
            if i + 1 - a[j] >= 0:
                dp[i + 1] += dp[i + 1 - a[j]]
                dp[i + 1] %= MOD
    
    for i in range(w,2*w):
        for j in range(n):
            if i + 1 - a[j] >= 0 and i + 1 - a[j] != w:
                dp[i + 1] += dp[i + 1 - a[j]]
                dp[i + 1] %= MOD
    
    n1,n2 = dp[w],dp[2*w]
    M = Matrix([[n1,n2],[1,0]])
    M = M.pow(k,MOD)
    ans = (M[1][0] * n1 + M[1][1] * 1)%MOD
    print(ans)
if __name__ =='__main__':
    main()