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

#define MOD 1000000007
#define int long long
int w;
int n;

typedef vector<int> vec;
typedef vector<vec> mat;

const int M = MOD;

mat mul(mat &a, mat &b){
	mat c(a.size(), vec(b[0].size()));
	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] = (c[i][j] + a[i][k] * b[k][j] % M ) % M;
			}
		}
	}
	return c;
}

mat pow2(mat a, int n){
	mat b(a.size(), vec(a.size()));
	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 dp[100];

signed main(){
	int n, w, k;
	cin >> n >> w >> k;

	int a[100];
	for(int i = 0;i < n;i++) cin >> a[i];
	
	dp[0] = 1;

	for(int i = 0;i <= w;i++){
		for(int j = 0;j < n;j++){
			if(i+a[j] <= w){
				dp[i+a[j]] += dp[i];
				dp[i+a[j]] %= MOD;
			}
		}
	}

	int wc = dp[w];

	memset(dp, 0, sizeof(dp));
	dp[0] = 1;

	for(int i = 0;i <= 2*w;i++){
		for(int j = 0;j < n;j++){
			if(i+a[j] <= 2*w && i+a[j] != w){
				dp[i+a[j]] += dp[i];
				dp[i+a[j]] %= MOD;
			}
		}
	}

	int tc = dp[2*w];

	{
		mat a(2, vec(2));
		a[0][0] = wc;
		a[0][1] = tc;
		a[1][0] = 1;
		a[1][1] = 0;
		a = pow2(a, k+1);
		cout << a[1][0] << endl;
	}
	return 0;
}