using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Runtime.Intrinsics.Arm;

class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, w, k) = ((int)c[0], (int)c[1], c[2]);
        var a = NList;
        Array.Sort(a);
        WriteLine(Jump(n, w, k, a));
    }
    static long Jump(int n, int w, long k, long[] a)
    {
        var x = new long[w + 1][];
        for (var i = 0; i < w; ++i)
        {
            var dp = new long[w * 2 + 1];
            dp[i] = 1;
            for (var j = i; j < w; ++j)
            {
                foreach (var ai in a) if (j + ai < dp.Length)
                {
                    dp[j + ai] = (dp[j + ai] + dp[j]) % mod;
                }
            }
            x[i] = new long[w + 1];
            if (i == 0)
            {
                for (var j = 0; j <= w; ++j) x[i][j] = dp[w + j];
            }
            else
            {
                x[i][0] = dp[w];
            }
        }
        x[w] = new long[w + 1];
        x[w][0] = 1;
        var s = new long[1][];
        s[0] = new long[w + 1];
        s[0][0] = 1;
        var t = Mul(s, Pow(x, k));
        return t[0][0];
    }
    static int mod = 1_000_000_007;
    // 行列の累乗
    public static long[][] Pow(long[][] m, long k)
    {
        var multi = m;
        var r = new long[m.Length][];
        for (var i = 0; i < m.Length; ++i)
        {
            r[i] = new long[m.Length];
            r[i][i] = 1;
        }
        while (k > 0)
        {
            if ((k & 1) == 1) r = Mul(r, multi);
            multi = Mul(multi, multi);
            k >>= 1;
        }
        return r;
    }
    // 行列の積
    public static long[][] Mul(long[][] x, long[][] y)
    {
        var r = new long[x.Length][];
        for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length];
        for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k)
        {
            for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod;
        }
        return r;
    }
}