#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
  int N,M,K;
  cin>>N>>M>>K;
  vector<vector<int>> G(M+1);
  vector<int> dist(M+1,1e18);
  queue<int> q;
  dist[0] = 0;
  q.push(0);
  for(int i=0;i<N;i++){
  	int a;
  	cin>>a;
  	for(int j=0;j+a<=M;j++) G[j].push_back(j+a);
  }
  while(!q.empty()){
  	int pos = q.front();
  	q.pop();
  	for(int x:G[pos]){
  		if(dist[x] != 1e18) continue;
  		dist[x] = dist[pos] + 1;
  		q.push(x);
  	}
  }
  for(int i=M;i>=0;i--){
  	if(dist[i] <= K){
  		cout<<i<<endl;
  		return 0;
  	}
  }
}