#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <math.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<int,int> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
ll n,m,k;
ll dp[400][25],a[400],ans;
int main(void){
    cin>>n>>m>>k;
    dp[0][m]=k;
    n++;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;i++){
        for(int j=0;j<=m;j++){
            dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
            if(j==0)continue;
            ll o=dp[i][j]/a[i];
            for(int l=i+1;l<n;l++){
                dp[l+1][j-1]=max(dp[l+1][j-1],dp[i][j]+o*(a[l]-a[i]));
            }
        }
    }
    for(int i=0;i<=m;i++)ans=max(ans,dp[n][i]);
    cout<<ans;
}