#pragma GCC optimize("Ofast", "unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const ll mod = 1000000007LL;

struct Matrix {
	int n;
	vector<vector<ll>> element;

	Matrix(int n) : n(n) {
		element.resize(n);
		for (int i = 0; i < n; ++i)
			element[i].resize(n, 0);
	}

	Matrix operator *(Matrix a) {
		assert(n == a.n);
		Matrix res(n);
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				ll tmp = 0;
				for (int k = 0; k < n; ++k) {
					tmp += element[i][k] * a.element[k][j] % mod;
					tmp %= mod;
				}
				res.element[i][j] = tmp;
			}
		}
		return res;
	}

	Matrix pow(ll k) {
		if (k == 0) {
			Matrix res(n);
			for (int i = 0; i < n; ++i)
				res.element[i][i] = 1;
			return res;
		}
		Matrix tmp = pow(k / 2);
		if (k % 2 == 1)
			return tmp * tmp * (*this);
		return tmp * tmp;
	}
};

int main() {
	int N, W; ll K;
	cin >> N >> W >> K;
	vector<int> A(N);
	for (int i = 0; i < N; ++i) cin >> A[i];
	sort(A.begin(), A.end());
	// dp[i] := i個先に行く方法
	vector<ll> dp(2 * W + 1, 0);
	dp[0] = 1;
	for (int i = 1; i <= 2 * W; ++i) {
		for (int j = 0; j < N; ++j) {
			if (i < A[j]) break;
			dp[i] = (dp[i] + dp[i - A[j]]) % mod;
		}
	}
	// front1 := 一個先の石に飛ぶ方法
	// front2 := 二個先の石に(一個先を飛ばして)飛ぶ方法
	ll front1 = dp[W];
	ll front2 = (dp[2 * W] - (dp[W] * dp[W] % mod) + mod) % mod;
	// 遷移行列を求める
	Matrix X(2);
	X.element[0][0] = front1; X.element[0][1] = front2;
	X.element[1][0] = 1;
	// 答えの計算
	X = X.pow(K);
	cout << (X.element[0][0]) << endl;
	return 0;
}