#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;
ll const mod = 1e9+7;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

vector<vector<ll>> prod(vector<vector<ll>>& a, vector<vector<ll>>& b) {
    vector<vector<ll>> ret(a.size(),vector<ll>(b[0].size(),0));
    for (int i = 0;i < a.size();++i) for (int j = 0;j < b[0].size();++j) for (int k = 0;k < a[0].size();++k) {
        (ret[i][j] += a[i][k]*b[k][j]%mod) %= mod;
    }
    return ret;
}

int main() {
    int n,w;
    ll k;
    cin >> n >> w >> k;
    vector<ll> dp(2*w+1,0);
    vector<int> a(n);
    for (int i = 0;i < n;++i) cin >> a[i];
    dp[0] = 1;
    for (int i = 0;i < 2*w;++i) {
        for (int j = 0;j < n;++j) if (i+a[j] <= 2*w) (dp[i+a[j]] += dp[i]) %= mod;
    }
    vector<vector<ll>> c(2,vector<ll>(2)),b(2,vector<ll>(1));
    c[0][1] = 1;
    c[1][1] = dp[w];
    c[1][0] = (dp[2*w]-dp[w]*dp[w]%mod+mod)%mod;
    b[0][0] = 1;
    b[1][0] = dp[w];
    while (k) {
        if (k&1) b = prod(c,b);
        c = prod(c,c);
        k >>= 1;
    }
    cout << b[0][0] << endl;
}