#include <iostream>
using namespace std;
#define ll long long
ll a[390], dp[390][21];
int main(){
    int n, m, k;
    cin >> n >> m >> k;
    ++n;
    for(int i=0; i<n; ++i) cin >> a[i];
    for(int i=0; i<=m; ++i) dp[0][i] = k;
    for(int i=0; i<n; ++i) dp[i][0] = k;
    for(int i=1; i<n; ++i){
        for(int j=1; j<=m; ++j){
            dp[i][j] = dp[i-1][j];
            for(int k=0; k<i; ++k){
                dp[i][j] = max(dp[i][j],
                        dp[k][j-1]%a[k]+(dp[k][j-1]/a[k])*a[i]);
            }
        }
    }
    cout << dp[n-1][m] << endl;
    return 0;
}