#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1000000007;

ll modpow(ll x, ll n, ll mod = MOD) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

using vec = vector<ll>;
using mat = vector<vec>;

mat mul(mat& A, mat& B) {
    mat C(A.size(), vec(B[0].size(), 0));
    for (int i = 0; i < A.size(); i++) {
        for (int k = 0; k < B.size(); k++) {
            for (int j = 0; j < B[0].size(); j++) {
                (C[i][j] += A[i][k] * B[k][j] % MOD) %= MOD;
            }
        }
    }
    return C;
}

mat pow(mat A, ll n) {
    mat B(A.size(), vec(A.size(), 0));
    for (int i = 0; i < A.size(); i++) {
        B[i][i] = 1;
    }
    while (n > 0) {
        if (n & 1) B = mul(B, A);
        A = mul(A, A);
        n >>= 1;
    }
    return B;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, w;
    ll K;
    cin >> n >> w >> K;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    vector<ll> dp(2 * w + 1, 0);
    dp[0] = 1;
    for (int i = 0; i < 2 * w; ++i) {
        for (int j : a) {
            if (i + j > 2 * w) continue;
            (dp[i + j] += dp[i]) %= MOD;
        }
    }

    ll x = dp[w], y = (dp[2 * w] + MOD - x * x % MOD) % MOD;
    mat A(3, vec(3, 0));
    A[0][1] = 1;
    A[1][2] = 1;
    A[2][1] = y;
    A[2][2] = x;

    mat B = {{1}, {dp[w]}, {dp[2 * w]}};
    A = pow(A, K);
    B = mul(A, B);
    cout << B[0][0] << "\n";
    // f[i] = f[i - 2] * y + f[i - 1] * x
    return 0;
}