#include<bits/stdc++.h>
#define int long long
using namespace std;
#define fi first
#define sc second
#define pii pair<int,int>
#define pdd pair<double,double>
#define pb push_back
#define umap unordered_map
#define mset multiset
#define pq priority_queue
#define ull unsigned long long
#define i128 __int128
#define ld long double
#define fixs fixed<<setprecision
#define FileIn(x) freopen(x".in","r",stdin)
#define FileOut(x) freopen(x".out","w",stdout)
#define FileIO(x) FileIn(x),FileOut(x);
const int maxn=500+10;
int n,m,p,a[maxn],res,f[maxn][maxn];
void chkmax(int &x,int y){
    x=max(x,y);
}
void solve(){
    cin>>n>>m>>p,n++;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=0;i<=n;i++) for(int j=0;j<=m;j++) f[i][j]=-1e12;
    f[1][0]=p;
    for(int i=2;i<=n;i++){
        for(int j=0;j<=m;j++) f[i][j]=f[i-1][j];
        for(int j=1;j<i;j++){
            for(int k=1;k<=m;k++) chkmax(f[i][k],f[j][k-1]-f[j][k-1]/a[j]*a[j]+f[j][k-1]/a[j]*a[i]);
        }
        // for(int j=0;j<=m;j++) cout<<f[i][j]<<" ";cout<<endl;
    }
    cout<<*max_element(f[n],f[n]+m+1)<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) solve();
    return 0;
}
/*
Samples
input:

output:

THINGS TODO:
检查freopen，尤其是后缀名
检查空间
检查调试语句是否全部注释
*/