#include<bits/stdc++.h> using namespace std; using Int = long long; template<typename T> vector<T> make_v(size_t a){return vector<T>(a);} template<typename T> vector<vector<T> > make_v(size_t a,size_t b){ return vector<vector<T> >(a,make_v<T>(b)); } template<typename T> vector<vector<vector<T> > > make_v(size_t a,size_t b,size_t c){ return vector<vector<vector<T> > > (a,make_v<T>(b,c)); } template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;} template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){ for(auto &e:t) fill_v(e,v); } template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;} template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;} //INSERT ABOVE HERE signed main(){ Int n,m,k; cin>>n>>m>>k; n++; vector<Int> a(n); for(Int i=0;i<n;i++) cin>>a[i]; auto dp=make_v<Int>(n,m+1); fill_v(dp,-1); dp[0][0]=k; for(Int i=0;i<n;i++){ for(Int j=m;j>=0;j--){ if(dp[i][j]<0) continue; for(Int k=i+1;k<n;k++){ chmax(dp[k][j],dp[i][j]); if(j==m) continue; //cout<<i<<" "<<j<<" "<<k<<":"<<(a[k]-a[i])<<" "<<(dp[i][j]/a[i])<<endl; chmax(dp[k][j+1],dp[i][j]+(a[k]-a[i])*(dp[i][j]/a[i])); } } } Int ans=k; for(Int j=0;j<=m;j++) chmax(ans,dp[n-1][j]); cout<<ans<<endl; return 0; }