#include <bits/stdc++.h>

using namespace std;

using ll = long long;

ll dp[400][25];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m, K;
    cin >> n >> m >> K;
    n++;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    dp[0][0] = K;
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (j == 0) dp[i][1] = max(dp[i][1], dp[0][0] / a[0] * a[i] + dp[0][0] % a[0]);
            ll tmp = 0;
            for (int k = 1 - (j == 0); k < i - 1; k++) {
                tmp = max(tmp, dp[k][j]);
                dp[i][j + 1] = max(dp[i][j + 1], tmp / a[k + 1] * a[i] + tmp % a[k + 1]);
            }
        }
    }

    ll ans = K;
    for (int i = 1; i < n; i++) {
        for (int j = 1; j <= m; j++) {
            ans = max(ans, dp[i][j]);
        }
    }
    cout << ans << endl;
    return 0;
}