#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
vector<vector<ll>> matrixmul(int l, int m, int n, vector<vector<ll>> a, vector<vector<ll>> b){
	vector<vector<ll>> c(l, vector<ll>(n));
	for(int i=0; i<l; i++){
		for(int j=0; j<n; j++){
			for(int k=0; k<m; k++){
				(c[i][j]+=a[i][k]*b[k][j])%=MOD;
			}
		}
	}
	return c;
}
vector<vector<ll>> matrixpow(int n, vector<vector<ll>> a, ll k){
	vector<vector<ll>> ap=a, ans(n, vector<ll>(n));
	for(int i=0; i<n; i++) ans[i][i]=1;
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
int main()
{
    int n, w;
    ll k;
    cin>>n>>w>>k;
    int a[100];
    for(int i=0; i<n; i++) cin>>a[i];
    ll dp[100]={}, dp2[100]={};
    dp[0]=1;
    for(int i=1; i<=w; i++){
        for(int j=0; j<n; j++){
            if(i-a[j]>=0) (dp[i]+=dp[i-a[j]])%=MOD;
        }
    }
    dp2[0]=1;
    for(int i=1; i<=2*w; i++){
        if(i==w) continue;
        for(int j=0; j<n; j++){
            if(i-a[j]>=0) (dp2[i]+=dp2[i-a[j]])%=MOD;
        }
    }
    vector<vector<ll>> mat(2, vector<ll>(2));
    mat[0][1]=1, mat[1][0]=dp2[2*w], mat[1][1]=dp[w];
    auto matp=matrixpow(2, mat, k);
    cout<<(matp[0][0]+matp[0][1]*dp[w])%MOD<<endl;
    return 0;
}