#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=400,M=30;
int n,m,k,a[N];
int f[N][M];
inline int calc(int x,int p,int q){
	if(p>=q) return x;
	int t=x/p;
	return x+t*(q-p);
}
signed main(){
	//freopen("stock.in","r",stdin);
	//freopen("stock.out","w",stdout);
	cin>>n>>m>>k;++n; 
	for(int i=1;i<=n;i++) cin>>a[i];
	f[0][0]=k;
	a[0]=1e18;
	int ans=0;
	for(int t=1;t<=m;t++){
		for(int i=t;i<=n;i++){	
			int mn=a[i-1];
			for(int j=i-1;j>=t-1;j--){
				mn=min(mn,a[j]);
				f[i][t]=max(f[i][t],calc(f[j][t-1],mn,a[i]));
			}
			ans=max(ans,f[i][t]);
		}
	}
	cout<<ans<<'\n';
	return 0;
}