#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;

inline void chmax(ll& a, ll b) { if (a < b) a = b; }

int main() {
    int n, m, K;
    cin >> n >> m >> K;
    ++n;
    
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    
    const ll INF = 1e18;
    vector dp(n, vector<ll>(m+1, -INF));
    dp[0][0] = K;
    for (int i = 1; i < n; ++i) {
        rep(j, m+1) dp[i][j] = dp[i-1][j];
        
        rep(j, i) {
            for (int k = 1; k <= m; ++k) {
                ll t = dp[j][k-1];
                chmax(dp[i][k], t%a[j] + t/a[j]*a[i]);
            }
        }
    }
    
    ll ans = ranges::max(dp.back());
    cout << ans << '\n';
    
    return 0;
}