#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
 
long long int INF = 1e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
// priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
// #define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
 
// ll mod = 998244353;
 ll mod = 1000000007;
  
ll mypow(ll number1,ll number2, ll mod){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

ll n,m,num,sum,a,b,d,e,h,r,l,q;
ll w;
ll k;
ll x[500005], y[500005], z[500005];
char s[500005], t[500005];

vec matmul(vec &dp, mat &mt){
    vec ret(2, 0ll);
    for(ll i=0;i<2;i++){
        for(ll j=0;j<2;j++){
            ret[i] += mt[i][j] * dp[j];
            ret[i] %= mod;
        }
    }
    return ret;
}
mat update(mat &mt){
    mat ret(2, vec(2, 0ll));
    for(ll i=0;i<2;i++){
        for(ll j=0;j<2;j++){
            for(ll k=0;k<2;k++){
                ret[i][j] += (mt[i][k] * mt[k][j]) % mod;
                ret[i][j] %= mod;
            }
        }
    }
    return ret;
}

void matpow(vec &dp, mat &mt, ll k){
    ll m = dp.size();
    while(k){
        if(k&1)dp = matmul(dp, mt);
        mt = update(mt);
        k /= 2;
    }
    return;
}

int main(){
    cin >> n >> w >> k;
    for(ll i=0;i<n;i++){
        cin >> x[i];
    }
    vec dp(2, 0ll);
    mat mt(2, vec(2));
    y[0] = 1;
    for(ll i=1;i<=2*w;i++){
        for(ll j=0;j<n;j++){
            if(i - x[j] < 0)continue;
            y[i] += y[i - x[j]];
            y[i] %= mod;
        }
    }
    ll a = y[w];
    y[0] = 1;
    for(ll i=1;i<=2*w;i++){
        y[i] = 0;
    }
    for(ll i=1;i<=2*w;i++){
        if(i == w)continue;
        for(ll j=0;j<n;j++){
            if(i - x[j] < 0)continue;
            y[i] += y[i - x[j]];
            y[i] %= mod;
        }
    }
    ll b = y[2 * w];
    mt[0][0] = 0, mt[0][1] = 1, mt[1][0] = b, mt[1][1] = a;

    

    dp[1] = 1;

    matpow(dp, mt, k);
    ll ans = dp[1];
    p(ans);




    return 0;
}