#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;

int main(){
    int N,K;
    ll M;
    cin>>N>>M>>K;
    vector<ll> A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
    }
    /*
    sort(A.begin(),A.end());
    reverse(A.begin(),A.end());
    
    ll ans=min(A[0]*K,M);
    cout<<ans<<endl;
    */
   
    priority_queue<P,vector<P>,greater<P>> pq;
    //priority_queue<ll,vector<ll>,greater<ll>> pq;
    
    //unordered_set<ll> st;
    
    map<ll,int> st;

    //st.insert(0);

    pq.emplace(0,0);
    while(!pq.empty()){
        auto [v,d]=pq.top();
        pq.pop();
        
        if(st.count(v) && st[v]<=d) continue;

        //st[v]>d
        //st.insert(v);
        st[v]=d;

        if(d+1<=K){
            for(int i=0;i<N;i++){
                if(v+A[i]>M) continue;

                if( !st.count(v+A[i]) || st[v+A[i]]>(d+1) ){
                    
                    pq.emplace(v+A[i],d+1);
                }
            }
        }
    }

    
    /*
    ll ans=0;
    for(ll v:st){
        ans=max(ans,v);
    }
    */
    ll ans= st.rbegin()->first;
    cout<<ans<<endl;
}