// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
}
signed main(){
  init_io();
  ll n,m,k;
  cin >> n >> m >> k;
  vector<ll> a(n);
  queue<P> que;
  set<ll> st;
  for (int i=0;i<n;i++) {
    cin >> a[i];
    if (a[i] <= m) {
      que.push(P(a[i], 1));
    }
  }
  while(!que.empty()) {
    auto [v, cnt] = que.front(); que.pop();
    st.insert(v);
    if (cnt == k) continue;
    for (int i=0;i<n;i++) {
      ll nxt = v + a[i];
      if (st.find(nxt) == st.end() && cnt < k && nxt <= m) {
        st.insert(nxt);
        que.push(P(nxt, cnt+1));
      }
    }
  }
  ll ans = 0;
  for (auto v: st) {
    ans = max(v, ans);
  }
  cout << ans << endl;
}