#include<bits/stdc++.h>
using namespace std;
int n,T,m;
int a[20+5];
bool cmp(int x,int y)
{
	return x>y;
}
int maxx;
vector<int>S;
void DFS(int res,int depth,vector<int>&D)
{
	if(res>T)
		return;
	if(depth==n+1)
	{
		if(res>maxx)
		{
			S=D;
			maxx=res;
		}
		
		return;
	}
	D.push_back(depth);
	DFS(res+a[depth],depth+1,D);
	D.pop_back();
	DFS(res,depth+1,D); 
}
int main()
{
	scanf("%d %d %d",&n,&T,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	sort(a+1,a+n+1,cmp);
	int cost=0;
//	int c=0;
	while(n)
	{
	//	cout<<++c<<' ';
		cost+=m;
		maxx=0;
		S.clear();
		vector<int>T_;
		DFS(0,1,T_);
		for(auto p:S)
		{
			a[p]=0;	
		}	
		sort(a+1,a+n+1,cmp);
		n-=S.size();
//		cout<<S.size()<<endl;
	}
	cout<<cost;
	return 0;
 }