#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

MOD = 10**9 + 7

N, W, K, *A = map(int, read().split())
A.sort()

dp = [0] * (W + 1)
dp[0] = 1
for i in range(W):
    for a in A:
        j = i + a
        if j > W:
            break
        dp[j] += dp[i]
P = dp[-1] % MOD

dp = [0] * (W + W + 1)
dp[0] = 1
for i in range(W + W):
    if i == W:
        dp[i] = 0
        continue
    for a in A:
        j = i + a
        if j > W + W:
            break
        dp[j] += dp[i]
Q = dp[-1] % MOD

# a_{n+2} = Pa_{n+1} + Qa_n
# a_{-1} = 0, a_0 = 1
# a_K = ?


def power(n):
    """x^n mod (x^2 - Px - Q)"""
    if n == 0:
        return 1, 0
    a, b = power(n // 2)
    a, b = a * a + Q * b * b, 2 * a * b + P * b * b
    if n % 2 == 0:
        return a % MOD, b % MOD
    a, b = Q * b, a + P * b
    return a % MOD, b % MOD


a, b = power(K + 1)
print(b)