#include <iostream>
#include <vector>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

using lint = long long;

void solve() {
    int n, m, k;
    std::cin >> n >> m >> k;

    std::vector<int> xs(n + 1);
    for (auto& x : xs) std::cin >> x;

    auto dp = vec(n + 1, vec(m + 1, 0LL));
    std::fill(dp[0].begin(), dp[0].end(), k);

    for (int r = 1; r <= n; ++r) {
        for (int i = 0; i <= m; ++i) {
            dp[r][i] = std::max(dp[r][i], dp[r - 1][i]);
        }

        for (int l = 0; l < r; ++l) {
            if (xs[r] <= xs[l]) continue;

            for (int i = 0; i < m; ++i) {
                lint gain = dp[l][i] / xs[l] * (xs[r] - xs[l]);
                dp[r][i + 1] = std::max(dp[r][i + 1], dp[l][i] + gain);
            }
        }
    }

    std::cout << dp[n][m] << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}